/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:37:44,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:37:44,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:37:44,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:37:44,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:37:44,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:37:45,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:37:45,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:37:45,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:37:45,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:37:45,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:37:45,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:37:45,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:37:45,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:37:45,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:37:45,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:37:45,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:37:45,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:37:45,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:37:45,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:37:45,020 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:37:45,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:37:45,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:37:45,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:37:45,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:37:45,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:37:45,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:37:45,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:37:45,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:37:45,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:37:45,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:37:45,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:37:45,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:37:45,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:37:45,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:37:45,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:37:45,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:37:45,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:37:45,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:37:45,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:37:45,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:37:45,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:37:45,034 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:37:45,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:37:45,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:37:45,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:37:45,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:37:45,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:37:45,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:37:45,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:37:45,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:37:45,055 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:37:45,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:37:45,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:37:45,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:37:45,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:37:45,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:37:45,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:37:45,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:37:45,058 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:37:45,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:37:45,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:37:45,058 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:37:45,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:37:45,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:37:45,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:37:45,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:37:45,240 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:37:45,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-27 14:37:45,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637266467/2442443c597f43b7a1d375c9b45e70f4/FLAG02b5a52c8 [2022-04-27 14:37:45,641 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:37:45,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c [2022-04-27 14:37:45,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637266467/2442443c597f43b7a1d375c9b45e70f4/FLAG02b5a52c8 [2022-04-27 14:37:45,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637266467/2442443c597f43b7a1d375c9b45e70f4 [2022-04-27 14:37:45,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:37:45,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:37:45,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:37:45,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:37:45,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:37:45,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed43548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45, skipping insertion in model container [2022-04-27 14:37:45,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:37:45,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:37:45,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c[458,471] [2022-04-27 14:37:45,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:37:45,790 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:37:45,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound20.c[458,471] [2022-04-27 14:37:45,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:37:45,811 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:37:45,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45 WrapperNode [2022-04-27 14:37:45,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:37:45,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:37:45,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:37:45,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:37:45,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:37:45,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:37:45,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:37:45,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:37:45,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (1/1) ... [2022-04-27 14:37:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:37:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:45,854 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:37:45,859 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:37:45,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:37:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:37:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:37:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:37:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:37:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:37:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:37:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:37:45,922 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:37:45,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:37:46,035 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:37:46,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:37:46,039 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:37:46,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:37:46 BoogieIcfgContainer [2022-04-27 14:37:46,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:37:46,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:37:46,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:37:46,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:37:46,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:37:45" (1/3) ... [2022-04-27 14:37:46,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b236675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:37:46, skipping insertion in model container [2022-04-27 14:37:46,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:37:45" (2/3) ... [2022-04-27 14:37:46,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b236675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:37:46, skipping insertion in model container [2022-04-27 14:37:46,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:37:46" (3/3) ... [2022-04-27 14:37:46,054 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2022-04-27 14:37:46,065 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:37:46,065 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:37:46,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:37:46,099 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@f925fc9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26bd09d0 [2022-04-27 14:37:46,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:37:46,109 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:37:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:37:46,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:46,114 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:37:46,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:37:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:46,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347606099] [2022-04-27 14:37:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:37:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:46,262 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:37:46,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:37:46,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:37:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:37:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:46,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:37:46,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:37:46,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:37:46,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:37:46,270 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:37:46,271 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:37:46,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:37:46,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:37:46,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:37:46,271 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:37:46,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {31#true} is VALID [2022-04-27 14:37:46,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:37:46,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:37:46,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:37:46,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:37:46,272 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:37:46,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:37:46,273 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:37:46,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:37:46,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:37:46,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:37:46,273 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:37:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347606099] [2022-04-27 14:37:46,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347606099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:37:46,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:37:46,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:37:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440079058] [2022-04-27 14:37:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:37:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:37:46,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:46,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:37:46,297 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:37:46,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:37:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:37:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:37:46,326 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:37:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:46,436 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:37:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:37:46,436 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:37:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:46,437 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:37:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:37:46,443 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:37:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:37:46,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:37:46,522 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:37:46,529 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:37:46,529 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:37:46,531 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:37:46,536 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:37:46,536 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:37:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:37:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:37:46,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:46,560 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:37:46,561 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:37:46,561 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:37:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:46,564 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:37:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:37:46,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:46,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:46,565 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:37:46,565 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:37:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:46,567 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:37:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:37:46,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:46,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:46,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:46,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:46,568 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:37:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:37:46,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:37:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:46,572 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:37:46,572 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:37:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:37:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:37:46,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:46,573 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:37:46,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:37:46,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:37:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030613360] [2022-04-27 14:37:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:46,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187070301] [2022-04-27 14:37:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:46,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:46,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:46,610 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:37:46,611 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:37:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:46,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:37:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:46,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:46,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:37:46,771 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:37:46,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:37:46,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:37:46,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:37:46,772 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:37:46,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {186#true} is VALID [2022-04-27 14:37:46,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:37:46,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:37:46,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:37:46,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:37:46,773 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:37:46,774 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:37:46,774 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:37:46,775 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:37:46,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:37:46,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:37:46,776 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:37:46,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:37:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:46,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030613360] [2022-04-27 14:37:46,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:46,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187070301] [2022-04-27 14:37:46,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187070301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:37:46,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:37:46,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:37:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274738071] [2022-04-27 14:37:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:37:46,778 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:37:46,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:46,778 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:37:46,790 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:37:46,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:37:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:37:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:37:46,791 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:37:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:46,990 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:37:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:37:46,990 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:37:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:46,990 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:37:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:37:46,992 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:37:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:37:46,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:37:47,022 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:37:47,024 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:37:47,024 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:37:47,024 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:37:47,025 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:37:47,025 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:37:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:37:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:37:47,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:47,031 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:37:47,031 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:37:47,031 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:37:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:47,033 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:37:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:37:47,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:47,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:47,033 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:37:47,034 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:37:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:47,035 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:37:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:37:47,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:47,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:47,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:47,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:47,036 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:37:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:37:47,038 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:37:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:37:47,038 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:37:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:37:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:37:47,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:47,039 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:37:47,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:47,255 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:37:47,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:37:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275047897] [2022-04-27 14:37:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:47,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:47,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99724053] [2022-04-27 14:37:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:47,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:47,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:47,277 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:37:47,309 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:37:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:47,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:37:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:47,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:47,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:37:47,485 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:37:47,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:47,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:37:47,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:37:47,485 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:37:47,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {397#true} is VALID [2022-04-27 14:37:47,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:37:47,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:37:47,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:47,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:37:47,489 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:37:47,490 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:37:47,491 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:37:47,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:37:47,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:37:47,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:47,494 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:37:47,494 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:37:47,495 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:37:47,495 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:37:47,496 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:37:47,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:37:47,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:37:47,497 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:37:47,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:47,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:37:47,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:37:47,678 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:37:47,679 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:37:47,679 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:37:50,211 WARN 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 UNKNOWN [2022-04-27 14:37:50,212 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:37:50,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:50,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:37:50,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:37:50,212 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:37:50,213 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:37:50,213 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:37:50,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:37:50,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:50,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:37:50,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:37:50,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {397#true} is VALID [2022-04-27 14:37:50,214 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:37:50,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:37:50,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:37:50,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:37:50,214 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:37:50,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:37:50,215 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:37:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275047897] [2022-04-27 14:37:50,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99724053] [2022-04-27 14:37:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99724053] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:50,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:37:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978879075] [2022-04-27 14:37:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:37:50,216 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:37:50,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:50,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:37:50,481 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:37:50,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:37:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:37:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:37:50,482 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:37:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:50,585 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:37:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:37:50,585 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:37:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:50,585 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:37:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:37:50,587 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:37:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:37:50,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:37:51,053 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:37:51,054 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:37:51,054 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:37:51,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:37:51,055 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:37:51,055 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:37:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:37:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:37:51,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:51,060 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:37:51,060 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:37:51,060 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:37:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:51,061 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:37:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:37:51,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:51,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:51,062 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:37:51,062 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:37:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:51,063 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:37:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:37:51,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:51,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:51,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:51,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:51,064 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:37:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:37:51,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:37:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:51,076 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:37:51,076 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:37:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:37:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:37:51,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:51,077 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:37:51,099 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:37:51,297 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:37:51,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:37:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:51,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089689678] [2022-04-27 14:37:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:51,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:51,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793436803] [2022-04-27 14:37:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:51,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:51,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:51,317 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:37:51,318 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:37:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:51,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:37:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:51,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:51,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:37:51,577 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:37:51,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:37:51,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:37:51,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:37:51,578 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:37:51,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {707#true} is VALID [2022-04-27 14:37:51,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:37:51,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:37:51,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:37:51,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:37:51,578 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:37:51,579 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:37:51,579 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:37:51,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:37:51,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:37:51,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:37:51,581 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:37:51,581 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:37:51,582 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:37:51,582 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:37:51,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:37:51,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:37:51,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:37:51,582 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:37:51,583 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:37:51,584 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:37:51,585 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:37:51,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:37:51,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:37:51,585 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:37:51,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089689678] [2022-04-27 14:37:51,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793436803] [2022-04-27 14:37:51,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793436803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:51,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:51,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:37:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486581253] [2022-04-27 14:37:51,815 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:51,816 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:37:51,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:51,816 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:37:51,836 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:37:51,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:37:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:51,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:37:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:37:51,837 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:37:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:52,003 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:37:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:37:52,004 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:37:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:52,004 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:37:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:37:52,005 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:37:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:37:52,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 14:37:52,030 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:37:52,030 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:37:52,031 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:37:52,031 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:37:52,031 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:52,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:37:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:37:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:37:52,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:52,038 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:37:52,038 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:37:52,038 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:37:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:52,040 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:37:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:37:52,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:52,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:52,040 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:37:52,040 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:37:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:52,041 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:37:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:37:52,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:52,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:52,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:52,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:52,042 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:37:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:37:52,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:37:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:52,043 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:37:52,043 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:37:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:37:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:37:52,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:52,044 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:37:52,063 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:37:52,260 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:37:52,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:37:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:52,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144544164] [2022-04-27 14:37:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:52,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:52,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623120067] [2022-04-27 14:37:52,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:37:52,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:52,287 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:37:52,289 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:37:52,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:37:52,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:52,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:37:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:52,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:52,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:37:52,586 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:37:52,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:37:52,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-27 14:37:52,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-27 14:37:52,587 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:37:52,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:37:52,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:37:52,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:37:52,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:37:52,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-27 14:37:52,587 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:37:52,588 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:37:52,588 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:37:52,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:37:52,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:37:52,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:37:52,589 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:37:52,589 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:37:52,589 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:37:52,589 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:37:52,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:37:52,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:37:52,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:37:52,590 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:37:52,591 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:37:52,591 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:37:52,591 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:37:52,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:37:52,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:37:52,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:37:52,592 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:37:52,592 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:37:52,593 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:37:52,593 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:37:52,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:37:52,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:37:52,594 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:37:52,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144544164] [2022-04-27 14:37:52,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623120067] [2022-04-27 14:37:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623120067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:52,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:52,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:37:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140235336] [2022-04-27 14:37:52,823 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:52,824 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:37:52,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:52,824 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:37:52,852 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:37:52,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:37:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:37:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:37:52,853 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:37:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:53,064 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-27 14:37:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:37:53,064 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:37:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:53,064 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:37:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:37:53,066 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:37:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:37:53,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 14:37:53,093 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:37:53,094 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:37:53,094 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:37:53,094 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:37:53,095 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:37:53,095 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:37:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:37:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:37:53,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:53,103 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:37:53,103 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:37:53,104 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:37:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:53,105 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:37:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:37:53,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:53,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:53,105 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:37:53,106 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:37:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:53,107 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:37:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:37:53,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:53,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:53,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:53,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:53,107 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:37:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 14:37:53,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 14:37:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:53,109 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 14:37:53,109 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:37:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:37:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:37:53,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:53,109 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:37:53,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:37:53,325 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:37:53,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-27 14:37:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287101191] [2022-04-27 14:37:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:53,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:53,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415150888] [2022-04-27 14:37:53,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:37:53,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:53,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:53,339 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:37:53,340 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:37:53,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:37:53,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:53,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:37:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:53,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:53,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 14:37:53,704 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:37:53,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-27 14:37:53,704 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:37:53,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-27 14:37:53,705 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:37:53,705 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:37:53,705 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:37:53,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:37:53,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:37:53,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,706 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:37:53,706 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:37:53,706 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:37:53,706 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:37:53,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:37:53,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:37:53,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,707 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:37:53,707 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:37:53,708 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:37:53,708 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:37:53,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:37:53,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:37:53,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,708 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:37:53,709 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:37:53,709 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:37:53,709 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:37:53,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:37:53,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:37:53,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:37:53,710 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:37:53,710 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:37:53,711 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:37:53,711 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:37:53,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 14:37:53,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 14:37:53,712 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:37:53,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287101191] [2022-04-27 14:37:53,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415150888] [2022-04-27 14:37:53,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415150888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:53,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:53,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:37:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837673851] [2022-04-27 14:37:53,986 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:53,986 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:37:53,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:53,986 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:37:54,008 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:37:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:37:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:37:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:37:54,009 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:37:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:54,289 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-27 14:37:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:37:54,289 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:37:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:54,289 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:37:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:37:54,291 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:37:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:37:54,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:37:54,320 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:37:54,321 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:37:54,321 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 14:37:54,321 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:37:54,322 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:37:54,322 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:37:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 14:37:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 14:37:54,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:54,332 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:37:54,332 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:37:54,333 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:37:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:54,334 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:37:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:37:54,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:54,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:54,334 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:37:54,334 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:37:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:54,336 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:37:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:37:54,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:54,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:54,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:54,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:54,336 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:37:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 14:37:54,338 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 14:37:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:54,339 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 14:37:54,340 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:37:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:37:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:37:54,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:54,341 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:37:54,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 14:37:54,545 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:37:54,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-27 14:37:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:54,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146221178] [2022-04-27 14:37:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:54,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883339696] [2022-04-27 14:37:54,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:37:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:54,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:54,559 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:37:54,560 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:37:54,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:37:54,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:54,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:37:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:54,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:55,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-27 14:37:55,059 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:37:55,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-27 14:37:55,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-27 14:37:55,059 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:37:55,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:37:55,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-27 14:37:55,060 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:37:55,060 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:37:55,060 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:37:55,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,061 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:37:55,061 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:37:55,062 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:37:55,062 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:37:55,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,062 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:37:55,063 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:37:55,063 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:37:55,063 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:37:55,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,064 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:37:55,064 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:37:55,065 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:37:55,065 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:37:55,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,065 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:37:55,066 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:37:55,066 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:37:55,066 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:37:55,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:37:55,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:37:55,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:37:55,071 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:37:55,072 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:37:55,072 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:37:55,073 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:37:55,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-27 14:37:55,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-27 14:37:55,073 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:37:55,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146221178] [2022-04-27 14:37:55,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883339696] [2022-04-27 14:37:55,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883339696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:55,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:55,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:37:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75296817] [2022-04-27 14:37:55,342 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:55,343 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:37:55,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:55,343 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:37:55,369 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:37:55,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:37:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:55,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:37:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:37:55,369 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:37:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:55,696 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-27 14:37:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:37:55,696 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:37:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:55,697 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:37:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:37:55,698 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:37:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:37:55,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 14:37:55,732 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:37:55,733 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:37:55,733 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:37:55,734 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:37:55,734 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:55,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:37:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:37:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:37:55,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:55,745 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:37:55,745 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:37:55,745 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:37:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:55,746 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:37:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:37:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:55,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:55,747 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:37:55,747 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:37:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:55,748 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:37:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:37:55,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:55,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:55,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:55,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:55,748 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:37:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 14:37:55,749 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 14:37:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:55,749 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 14:37:55,750 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:37:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:37:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:37:55,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:55,750 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:37:55,766 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:37:55,966 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:37:55,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-27 14:37:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:55,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677516682] [2022-04-27 14:37:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:55,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:55,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825835049] [2022-04-27 14:37:55,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:55,976 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:37:55,977 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:37:56,088 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:37:56,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:56,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:37:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:56,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:56,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2022-04-27 14:37:56,408 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:37:56,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} #60#return; {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} call #t~ret5 := main(); {2203#true} is VALID [2022-04-27 14:37:56,408 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:37:56,408 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} #52#return; {2203#true} is VALID [2022-04-27 14:37:56,409 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:37:56,409 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:37:56,409 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:37:56,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,410 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:37:56,410 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:37:56,411 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:37:56,411 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:37:56,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,411 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:37:56,412 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:37:56,412 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:37:56,412 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:37:56,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,413 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:37:56,413 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:37:56,414 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:37:56,414 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:37:56,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,414 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:37:56,415 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:37:56,415 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:37:56,415 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:37:56,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,416 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:37:56,416 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:37:56,417 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:37:56,417 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:37:56,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:56,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:56,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:56,417 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:37:56,418 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:37:56,419 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:37:56,419 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:37:56,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2204#false} is VALID [2022-04-27 14:37:56,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2022-04-27 14:37:56,420 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:37:56,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677516682] [2022-04-27 14:37:56,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825835049] [2022-04-27 14:37:56,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825835049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:56,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:56,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:37:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072537733] [2022-04-27 14:37:56,663 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:56,664 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:37:56,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:56,664 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:37:56,691 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:37:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:37:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:37:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:37:56,692 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:37:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:57,154 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-27 14:37:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:37:57,154 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:37:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:57,155 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:37:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:37:57,156 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:37:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:37:57,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-27 14:37:57,193 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:37:57,194 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:37:57,194 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 14:37:57,194 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:37:57,194 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:37:57,195 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:37:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 14:37:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 14:37:57,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:57,209 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:37:57,209 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:37:57,209 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:37:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:57,211 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:37:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:57,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:57,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:57,211 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:37:57,211 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:37:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:57,212 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:37:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:57,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:57,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:57,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:57,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:57,213 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:37:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 14:37:57,214 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 14:37:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:57,214 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 14:37:57,214 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:37:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 14:37:57,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:57,215 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:37:57,219 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:37:57,419 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:37:57,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-27 14:37:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:57,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297962930] [2022-04-27 14:37:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:57,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:57,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042445671] [2022-04-27 14:37:57,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:37:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:57,429 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:37:57,430 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:37:57,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:37:57,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:57,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:37:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:57,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:57,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 14:37:57,909 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:37:57,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #60#return; {2672#true} is VALID [2022-04-27 14:37:57,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret5 := main(); {2672#true} is VALID [2022-04-27 14:37:57,910 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:37:57,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {2672#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:57,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2672#true} {2672#true} #52#return; {2672#true} is VALID [2022-04-27 14:37:57,910 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:37:57,910 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:37:57,910 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:37:57,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,911 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:37:57,912 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:37:57,912 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:37:57,912 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:37:57,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,914 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:37:57,923 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:37:57,924 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:37:57,924 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:37:57,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,925 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:37:57,925 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:37:57,925 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:37:57,925 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:37:57,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,926 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:37:57,926 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:37:57,927 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:37:57,927 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:37:57,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,927 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:37:57,928 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:37:57,928 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:37:57,928 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:37:57,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,929 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:37:57,929 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:37:57,930 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:37:57,930 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:37:57,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:57,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:57,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:57,930 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:37:57,931 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:37:57,931 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:37:57,932 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:37:57,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {2872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 14:37:57,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 14:37:57,932 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:37:57,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:58,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297962930] [2022-04-27 14:37:58,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:58,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042445671] [2022-04-27 14:37:58,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042445671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:58,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:58,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:37:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88895067] [2022-04-27 14:37:58,173 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:58,174 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:37:58,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:58,174 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:37:58,205 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:37:58,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:37:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:37:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:37:58,205 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:37:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:58,766 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:37:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:37:58,766 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:37:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:58,766 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:37:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:37:58,767 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:37:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:37:58,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:37:58,805 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:37:58,807 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:37:58,807 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 14:37:58,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:37:58,809 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:37:58,809 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:37:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 14:37:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 14:37:58,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:58,827 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:37:58,827 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:37:58,827 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:37:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:58,833 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:37:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:58,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:58,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:58,833 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:37:58,833 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:37:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:58,836 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:37:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:58,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:58,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:58,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:58,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:58,836 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:37:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-27 14:37:58,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-27 14:37:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:58,838 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-27 14:37:58,838 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:37:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 14:37:58,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:58,839 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:37:58,850 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:37:59,050 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:37:59,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 7 times [2022-04-27 14:37:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:59,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144788300] [2022-04-27 14:37:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:59,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:59,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626321371] [2022-04-27 14:37:59,070 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:37:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:59,071 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:37:59,074 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:37:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:59,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:37:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:59,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:59,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-27 14:37:59,757 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:37:59,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #60#return; {3179#true} is VALID [2022-04-27 14:37:59,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret5 := main(); {3179#true} is VALID [2022-04-27 14:37:59,757 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:37:59,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {3179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:59,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3179#true} {3179#true} #52#return; {3179#true} is VALID [2022-04-27 14:37:59,762 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:37:59,762 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:37:59,762 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:37:59,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,765 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:37:59,766 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:37:59,766 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:37:59,766 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:37:59,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,767 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:37:59,767 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:37:59,767 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:37:59,767 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:37:59,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,768 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:37:59,768 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:37:59,769 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:37:59,769 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:37:59,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,769 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:37:59,770 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:37:59,770 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:37:59,770 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:37:59,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,771 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:37:59,771 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:37:59,771 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:37:59,771 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:37:59,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,772 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:37:59,772 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:37:59,773 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:37:59,773 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:37:59,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,773 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:37:59,774 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:37:59,774 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:37:59,774 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:37:59,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:59,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:59,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:59,775 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:37:59,775 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:37:59,776 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:37:59,776 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:37:59,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {3401#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3180#false} is VALID [2022-04-27 14:37:59,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-27 14:37:59,777 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:37:59,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144788300] [2022-04-27 14:38:00,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626321371] [2022-04-27 14:38:00,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626321371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:00,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:00,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:38:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226174263] [2022-04-27 14:38:00,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:00,081 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:00,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:00,081 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:00,111 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:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:38:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:00,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:38:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:38:00,112 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:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:00,703 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 14:38:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:38:00,703 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:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:00,704 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:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:38:00,705 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:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:38:00,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-27 14:38:00,747 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:00,748 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:38:00,748 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:38:00,748 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:00,748 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:00,748 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:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:38:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:38:00,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:00,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:38:00,769 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:38:00,769 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:38:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:00,770 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:38:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:00,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:00,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:00,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 14:38:00,771 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:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:00,772 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:38:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:00,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:00,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:00,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:00,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:00,772 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:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 14:38:00,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-27 14:38:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:00,773 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 14:38:00,773 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:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:38:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 14:38:00,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:00,774 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:00,784 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:00,978 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:00,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 8 times [2022-04-27 14:38:00,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437121250] [2022-04-27 14:38:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:00,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927638753] [2022-04-27 14:38:00,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:38:00,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:00,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:00,990 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:00,991 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:01,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:38:01,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:01,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:38:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:01,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:01,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {3724#true} call ULTIMATE.init(); {3724#true} is VALID [2022-04-27 14:38:01,990 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:01,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3724#true} {3724#true} #60#return; {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {3724#true} call #t~ret5 := main(); {3724#true} is VALID [2022-04-27 14:38:01,990 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:01,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {3724#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3724#true} {3724#true} #52#return; {3724#true} is VALID [2022-04-27 14:38:01,990 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:01,991 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:01,991 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:01,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,991 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:01,992 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:01,992 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:01,992 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:01,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,993 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:01,993 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:01,994 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:01,994 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:01,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,994 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:01,995 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:01,995 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:01,995 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:01,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,996 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:01,996 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:01,996 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:01,996 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:01,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:01,997 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:01,997 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:01,998 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:01,998 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:01,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:01,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:01,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:02,005 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:02,005 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:02,006 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:02,006 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:02,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:02,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:02,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:02,007 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:02,007 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:02,008 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:02,008 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:02,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:02,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:02,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:02,011 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:02,012 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:02,012 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:02,012 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:02,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:38:02,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:38:02,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:38:02,013 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:02,013 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:02,014 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:02,014 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:02,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {3968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3725#false} is VALID [2022-04-27 14:38:02,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {3725#false} assume !false; {3725#false} is VALID [2022-04-27 14:38:02,015 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:02,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:02,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437121250] [2022-04-27 14:38:02,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:02,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927638753] [2022-04-27 14:38:02,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927638753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:02,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:02,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:38:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792535278] [2022-04-27 14:38:02,282 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:02,283 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:02,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:02,283 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:02,318 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:02,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:38:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:38:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:38:02,319 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:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,054 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 14:38:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:38:03,054 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:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:03,054 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:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:38:03,057 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:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:38:03,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-27 14:38:03,105 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:03,106 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:38:03,106 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 14:38:03,106 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:03,106 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:03,106 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:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 14:38:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 14:38:03,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:03,129 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:03,129 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:03,129 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:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,130 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:38:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:03,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:03,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:03,131 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:03,131 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:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:03,132 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:38:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:03,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:03,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:03,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:03,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:03,132 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:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-27 14:38:03,133 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-27 14:38:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-27 14:38:03,133 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:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:38:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 14:38:03,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:03,134 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:03,150 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:03,348 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:03,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 9 times [2022-04-27 14:38:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:03,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741240604] [2022-04-27 14:38:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:03,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:03,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772537209] [2022-04-27 14:38:03,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:38:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:03,359 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:03,369 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:03,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:38:03,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:03,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 14:38:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:03,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:04,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2022-04-27 14:38:04,234 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:04,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #60#return; {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2022-04-27 14:38:04,234 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:04,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {4307#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4307#true} {4307#true} #52#return; {4307#true} is VALID [2022-04-27 14:38:04,234 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:04,235 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:04,235 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:04,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,235 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:04,236 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:04,236 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:04,236 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:04,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,236 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:04,237 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:04,237 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:04,237 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:04,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,238 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:04,238 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:04,238 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:04,238 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:04,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,239 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:04,240 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:04,240 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:04,240 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:04,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,241 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:04,241 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:04,241 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:04,241 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:04,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,242 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:04,242 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:04,242 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:04,243 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:04,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,243 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:04,243 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:04,244 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:04,244 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:04,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,244 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:04,245 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:04,245 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:04,245 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:04,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,246 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:04,246 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:04,247 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:04,247 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:04,247 INFO L290 TraceCheckUtils]: 77: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:38:04,247 INFO L290 TraceCheckUtils]: 78: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:38:04,247 INFO L290 TraceCheckUtils]: 79: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:38:04,247 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:04,248 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:04,248 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:04,249 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:04,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {4573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4308#false} is VALID [2022-04-27 14:38:04,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-04-27 14:38:04,249 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:04,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:04,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741240604] [2022-04-27 14:38:04,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:04,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772537209] [2022-04-27 14:38:04,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772537209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:04,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:04,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:38:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136171083] [2022-04-27 14:38:04,684 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:04,684 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:04,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:04,684 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:04,725 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:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:38:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:38:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:38:04,726 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:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:05,623 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-27 14:38:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:38:05,623 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:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:05,623 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:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:38:05,625 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:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:38:05,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-27 14:38:05,674 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:05,675 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:38:05,675 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:38:05,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:38:05,676 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:05,676 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:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:38:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:38:05,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:05,700 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:05,700 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:05,700 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:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:05,702 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:38:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:05,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:05,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:05,702 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:05,702 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:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:05,703 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:38:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:05,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:05,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:05,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:05,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:05,704 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:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-27 14:38:05,719 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-27 14:38:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-27 14:38:05,719 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:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:38:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:38:05,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:05,720 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:05,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:05,925 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:05,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 10 times [2022-04-27 14:38:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:05,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505327234] [2022-04-27 14:38:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:05,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:05,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145170717] [2022-04-27 14:38:05,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:38:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:05,936 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:05,936 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:06,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:38:06,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:06,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:38:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:06,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:06,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2022-04-27 14:38:06,971 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:06,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #60#return; {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret5 := main(); {4972#true} is VALID [2022-04-27 14:38:06,971 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:06,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {4972#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4972#true} {4972#true} #52#return; {4972#true} is VALID [2022-04-27 14:38:06,971 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:06,972 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:06,972 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:06,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:06,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:06,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,979 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:06,980 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:06,980 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:06,980 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:06,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:06,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:06,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,981 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:06,981 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:06,982 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:06,982 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:06,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:06,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:06,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,982 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:06,983 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:06,992 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:06,992 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:06,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:06,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:06,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:06,999 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:07,000 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:07,000 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:07,000 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:07,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,001 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:07,001 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:07,001 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:07,001 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:07,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,003 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:07,004 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:07,004 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:07,004 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:07,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,005 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:07,005 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:07,005 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:07,005 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:07,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,006 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:07,006 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:07,006 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:07,007 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:07,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,007 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:07,007 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:07,008 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:07,008 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:07,008 INFO L290 TraceCheckUtils]: 77: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,008 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:07,009 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:07,009 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:07,009 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:07,009 INFO L290 TraceCheckUtils]: 84: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:38:07,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:38:07,009 INFO L290 TraceCheckUtils]: 86: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:38:07,009 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:07,010 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:07,011 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:07,011 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:07,011 INFO L290 TraceCheckUtils]: 91: Hoare triple {5260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4973#false} is VALID [2022-04-27 14:38:07,011 INFO L290 TraceCheckUtils]: 92: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2022-04-27 14:38:07,011 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:07,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:07,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505327234] [2022-04-27 14:38:07,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:07,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145170717] [2022-04-27 14:38:07,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145170717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:07,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:07,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:38:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261793479] [2022-04-27 14:38:07,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:07,261 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:07,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:07,262 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:07,302 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:07,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:38:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:38:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:38:07,302 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:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:08,308 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:38:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:38:08,308 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:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:08,309 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:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:38:08,310 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:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:38:08,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-27 14:38:08,359 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:08,360 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:38:08,360 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:38:08,361 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:08,361 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:08,361 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:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:38:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 14:38:08,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:08,383 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:08,383 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:08,383 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:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:08,385 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:38:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:08,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:08,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:08,385 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:08,385 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:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:08,387 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:38:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:08,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:08,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:08,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:08,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:08,387 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:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 14:38:08,388 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-27 14:38:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:08,388 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 14:38:08,388 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:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:38:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 14:38:08,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:08,389 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:08,396 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:08,594 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:08,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 11 times [2022-04-27 14:38:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:08,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337623389] [2022-04-27 14:38:08,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:08,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:08,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684579036] [2022-04-27 14:38:08,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:38:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:08,615 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:08,615 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:09,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:38:09,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:09,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-27 14:38:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:09,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:09,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {5631#true} call ULTIMATE.init(); {5631#true} is VALID [2022-04-27 14:38:09,831 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:09,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5631#true} {5631#true} #60#return; {5631#true} is VALID [2022-04-27 14:38:09,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5631#true} call #t~ret5 := main(); {5631#true} is VALID [2022-04-27 14:38:09,832 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:09,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {5631#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:38:09,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5631#true} {5631#true} #52#return; {5631#true} is VALID [2022-04-27 14:38:09,832 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:09,832 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:09,832 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:09,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,833 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:09,833 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:09,834 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:09,834 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:09,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,834 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:09,835 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:09,835 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:09,835 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:09,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,836 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:09,836 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:09,836 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:09,836 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:09,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,837 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:09,837 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:09,838 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:09,838 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:09,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,839 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:09,839 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:09,839 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:09,840 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:09,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,840 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:09,840 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:09,841 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:09,841 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:09,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,841 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:09,842 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:09,842 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:09,842 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:09,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,843 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:09,843 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:09,843 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:09,843 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:09,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,844 INFO L290 TraceCheckUtils]: 72: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,844 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:09,844 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:09,845 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:09,845 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:09,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,845 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:09,846 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:09,846 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:09,846 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:09,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,847 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:09,847 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:09,847 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:09,847 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:09,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:38:09,847 INFO L290 TraceCheckUtils]: 92: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:38:09,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:38:09,848 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:09,848 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:09,849 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:09,849 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:09,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {5941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5632#false} is VALID [2022-04-27 14:38:09,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {5632#false} assume !false; {5632#false} is VALID [2022-04-27 14:38:09,850 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:09,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:11,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337623389] [2022-04-27 14:38:11,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684579036] [2022-04-27 14:38:11,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684579036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:11,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:11,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:38:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524962330] [2022-04-27 14:38:11,061 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:11,061 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:11,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:11,062 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:11,108 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:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:38:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:38:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:38:11,109 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:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:12,413 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 14:38:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:38:12,413 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:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:12,414 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:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:38:12,415 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:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:38:12,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-27 14:38:12,469 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:12,470 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:38:12,470 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 14:38:12,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:38:12,471 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:12,471 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.5s Time] [2022-04-27 14:38:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 14:38:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 14:38:12,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:12,507 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:12,507 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:12,507 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:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:12,509 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:38:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:12,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:12,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:12,509 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:12,509 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:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:12,510 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:38:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:12,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:12,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:12,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:12,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:12,511 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:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-27 14:38:12,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-27 14:38:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:12,512 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-27 14:38:12,512 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:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:38:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 14:38:12,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:12,513 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:12,526 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:12,718 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:12,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 12 times [2022-04-27 14:38:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520457489] [2022-04-27 14:38:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:12,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:12,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003534021] [2022-04-27 14:38:12,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:38:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:12,731 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:12,732 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:12,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:38:12,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:12,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-27 14:38:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:12,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:13,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {6548#true} call ULTIMATE.init(); {6548#true} is VALID [2022-04-27 14:38:13,645 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:13,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6548#true} {6548#true} #60#return; {6548#true} is VALID [2022-04-27 14:38:13,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {6548#true} call #t~ret5 := main(); {6548#true} is VALID [2022-04-27 14:38:13,645 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:13,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {6548#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:13,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6548#true} {6548#true} #52#return; {6548#true} is VALID [2022-04-27 14:38:13,647 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:13,647 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:13,647 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:13,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,648 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:13,648 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:13,649 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:13,649 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:13,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,649 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:13,650 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:13,650 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:13,650 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:13,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,655 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:13,656 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:13,656 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:13,656 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:13,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,657 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:13,657 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:13,658 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:13,658 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:13,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,658 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:13,659 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:13,659 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:13,659 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:13,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,660 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:13,660 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:13,661 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:13,661 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:13,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,661 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:13,662 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:13,662 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:13,662 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:13,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,663 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:13,663 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:13,664 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:13,664 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:13,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,664 INFO L290 TraceCheckUtils]: 71: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,665 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:13,665 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:13,665 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:13,665 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:13,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,666 INFO L290 TraceCheckUtils]: 79: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,666 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:13,667 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:13,667 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:13,667 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:13,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,667 INFO L290 TraceCheckUtils]: 85: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,667 INFO L290 TraceCheckUtils]: 86: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,668 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:13,668 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:13,668 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:13,669 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:13,669 INFO L290 TraceCheckUtils]: 91: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,669 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6548#true} {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:38:13,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:13,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !false; {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:13,670 INFO L272 TraceCheckUtils]: 97: Hoare triple {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:38:13,670 INFO L290 TraceCheckUtils]: 98: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:38:13,670 INFO L290 TraceCheckUtils]: 99: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:38:13,670 INFO L290 TraceCheckUtils]: 100: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:38:13,671 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {6548#true} {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #54#return; {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:38:13,671 INFO L290 TraceCheckUtils]: 102: Hoare triple {6850#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6872#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:38:13,672 INFO L272 TraceCheckUtils]: 103: Hoare triple {6872#(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)); {6876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:13,672 INFO L290 TraceCheckUtils]: 104: Hoare triple {6876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:13,672 INFO L290 TraceCheckUtils]: 105: Hoare triple {6880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6549#false} is VALID [2022-04-27 14:38:13,672 INFO L290 TraceCheckUtils]: 106: Hoare triple {6549#false} assume !false; {6549#false} is VALID [2022-04-27 14:38:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:38:13,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:14,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520457489] [2022-04-27 14:38:14,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:14,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003534021] [2022-04-27 14:38:14,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003534021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:14,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:14,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 14:38:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941306130] [2022-04-27 14:38:14,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:38:14,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:14,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:38:14,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:14,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:38:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:38:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:38:14,501 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:38:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,949 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-27 14:38:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:38:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:38:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:38:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-27 14:38:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:38:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-27 14:38:15,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-27 14:38:16,024 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:38:16,025 INFO L225 Difference]: With dead ends: 72 [2022-04-27 14:38:16,025 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 14:38:16,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-04-27 14:38:16,026 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:16,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 527 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:38:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 14:38:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 14:38:16,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:16,060 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:38:16,060 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:38:16,061 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:38:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:16,062 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:38:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:38:16,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:16,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:16,062 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:38:16,062 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:38:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:16,063 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:38:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:38:16,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:16,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:16,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:16,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:16,064 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:38:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 14:38:16,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-27 14:38:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:16,065 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 14:38:16,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 15 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:38:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:38:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:38:16,066 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:16,066 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:38:16,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:16,270 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:38:16,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 13 times [2022-04-27 14:38:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:16,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939242583] [2022-04-27 14:38:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:16,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018975513] [2022-04-27 14:38:16,298 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:38:16,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:16,299 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:38:16,303 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:38:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:17,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-27 14:38:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:17,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:17,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {7415#true} call ULTIMATE.init(); {7415#true} is VALID [2022-04-27 14:38:17,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {7415#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); {7415#true} is VALID [2022-04-27 14:38:17,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7415#true} {7415#true} #60#return; {7415#true} is VALID [2022-04-27 14:38:17,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {7415#true} call #t~ret5 := main(); {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {7415#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; {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {7415#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7415#true} {7415#true} #52#return; {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7453#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {7453#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7453#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,833 INFO L272 TraceCheckUtils]: 13: Hoare triple {7453#(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)); {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,834 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7415#true} {7453#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7453#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {7453#(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; {7475#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:17,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {7475#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7475#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:17,834 INFO L272 TraceCheckUtils]: 20: Hoare triple {7475#(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)); {7415#true} is VALID [2022-04-27 14:38:17,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,835 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7415#true} {7475#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7475#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:38:17,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {7475#(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; {7497#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:17,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {7497#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {7497#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:17,836 INFO L272 TraceCheckUtils]: 27: Hoare triple {7497#(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)); {7415#true} is VALID [2022-04-27 14:38:17,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,836 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7415#true} {7497#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {7497#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:38:17,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {7497#(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; {7519#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:17,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {7519#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {7519#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:17,837 INFO L272 TraceCheckUtils]: 34: Hoare triple {7519#(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)); {7415#true} is VALID [2022-04-27 14:38:17,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,837 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7415#true} {7519#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {7519#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:38:17,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {7519#(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; {7541#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {7541#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {7541#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,838 INFO L272 TraceCheckUtils]: 41: Hoare triple {7541#(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)); {7415#true} is VALID [2022-04-27 14:38:17,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,838 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7415#true} {7541#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {7541#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:17,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {7541#(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; {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,839 INFO L272 TraceCheckUtils]: 48: Hoare triple {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7415#true} is VALID [2022-04-27 14:38:17,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,839 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7415#true} {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {7563#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7585#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:38:17,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {7585#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {7585#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:38:17,840 INFO L272 TraceCheckUtils]: 55: Hoare triple {7585#(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)); {7415#true} is VALID [2022-04-27 14:38:17,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,840 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7415#true} {7585#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {7585#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:38:17,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {7585#(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; {7607#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:17,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {7607#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {7607#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:17,841 INFO L272 TraceCheckUtils]: 62: Hoare triple {7607#(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)); {7415#true} is VALID [2022-04-27 14:38:17,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,842 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7415#true} {7607#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {7607#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:38:17,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {7607#(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; {7629#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:17,842 INFO L290 TraceCheckUtils]: 68: Hoare triple {7629#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7629#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:17,842 INFO L272 TraceCheckUtils]: 69: Hoare triple {7629#(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)); {7415#true} is VALID [2022-04-27 14:38:17,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,843 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7415#true} {7629#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {7629#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:38:17,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {7629#(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; {7651#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,843 INFO L290 TraceCheckUtils]: 75: Hoare triple {7651#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7651#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,843 INFO L272 TraceCheckUtils]: 76: Hoare triple {7651#(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)); {7415#true} is VALID [2022-04-27 14:38:17,843 INFO L290 TraceCheckUtils]: 77: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,843 INFO L290 TraceCheckUtils]: 78: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,844 INFO L290 TraceCheckUtils]: 79: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,844 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7415#true} {7651#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {7651#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:17,844 INFO L290 TraceCheckUtils]: 81: Hoare triple {7651#(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; {7673#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,844 INFO L290 TraceCheckUtils]: 82: Hoare triple {7673#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7673#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,844 INFO L272 TraceCheckUtils]: 83: Hoare triple {7673#(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)); {7415#true} is VALID [2022-04-27 14:38:17,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,845 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7415#true} {7673#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {7673#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:38:17,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {7673#(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; {7695#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:17,845 INFO L290 TraceCheckUtils]: 89: Hoare triple {7695#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {7695#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:17,846 INFO L272 TraceCheckUtils]: 90: Hoare triple {7695#(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)); {7415#true} is VALID [2022-04-27 14:38:17,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {7415#true} ~cond := #in~cond; {7415#true} is VALID [2022-04-27 14:38:17,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {7415#true} assume !(0 == ~cond); {7415#true} is VALID [2022-04-27 14:38:17,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {7415#true} assume true; {7415#true} is VALID [2022-04-27 14:38:17,846 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7415#true} {7695#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {7695#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:38:17,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {7695#(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; {7717#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:38:17,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {7717#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7717#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:38:17,847 INFO L272 TraceCheckUtils]: 97: Hoare triple {7717#(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)); {7415#true} is VALID [2022-04-27 14:38:17,847 INFO L290 TraceCheckUtils]: 98: Hoare triple {7415#true} ~cond := #in~cond; {7727#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:17,848 INFO L290 TraceCheckUtils]: 99: Hoare triple {7727#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:17,848 INFO L290 TraceCheckUtils]: 100: Hoare triple {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:17,849 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} {7717#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {7738#(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:38:17,849 INFO L290 TraceCheckUtils]: 102: Hoare triple {7738#(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; {7742#(and (< 12 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 6084) main_~x~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:17,851 INFO L290 TraceCheckUtils]: 103: Hoare triple {7742#(and (< 12 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 6084) main_~x~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {7742#(and (< 12 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 6084) main_~x~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:17,851 INFO L272 TraceCheckUtils]: 104: Hoare triple {7742#(and (< 12 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 6084) main_~x~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7415#true} is VALID [2022-04-27 14:38:17,851 INFO L290 TraceCheckUtils]: 105: Hoare triple {7415#true} ~cond := #in~cond; {7727#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:17,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {7727#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:17,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:38:17,852 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7731#(not (= |__VERIFIER_assert_#in~cond| 0))} {7742#(and (< 12 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 6084) main_~x~0) (<= main_~c~0 13) (= main_~y~0 13))} #54#return; {7761#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:17,853 INFO L290 TraceCheckUtils]: 109: Hoare triple {7761#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7765#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:38:17,853 INFO L272 TraceCheckUtils]: 110: Hoare triple {7765#(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)); {7769#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:17,853 INFO L290 TraceCheckUtils]: 111: Hoare triple {7769#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7773#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:17,854 INFO L290 TraceCheckUtils]: 112: Hoare triple {7773#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7416#false} is VALID [2022-04-27 14:38:17,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {7416#false} assume !false; {7416#false} is VALID [2022-04-27 14:38:17,854 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:38:17,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:57,779 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4)))) is different from false [2022-04-27 14:38:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939242583] [2022-04-27 14:38:57,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018975513] [2022-04-27 14:38:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018975513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:57,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:38:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86572032] [2022-04-27 14:38:57,782 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:57,782 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:38:57,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:57,783 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:38:57,847 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:38:57,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:38:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:38:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=4, NotChecked=52, Total=812 [2022-04-27 14:38:57,848 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:38:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:59,910 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-27 14:38:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:38:59,910 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:38:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:59,910 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:38:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:38:59,912 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:38:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:38:59,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-27 14:38:59,978 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:38:59,979 INFO L225 Difference]: With dead ends: 75 [2022-04-27 14:38:59,979 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 14:38:59,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=4, NotChecked=58, Total=992 [2022-04-27 14:38:59,980 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:59,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 569 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:38:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 14:39:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 14:39:00,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:00,022 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:39:00,022 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:39:00,022 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:39:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:00,024 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:39:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:39:00,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:00,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:00,025 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:39:00,025 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:39:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:00,027 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:39:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:39:00,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:00,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:00,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:00,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:00,027 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:39:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-27 14:39:00,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-27 14:39:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:00,029 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-27 14:39:00,029 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:39:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:39:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 14:39:00,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:00,030 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:39:00,047 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:39:00,238 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:39:00,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 14 times [2022-04-27 14:39:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:00,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129119451] [2022-04-27 14:39:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:00,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:00,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781536702] [2022-04-27 14:39:00,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:39:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:00,270 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:39:00,291 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:39:00,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:39:00,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:00,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:39:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:00,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:01,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {8197#true} call ULTIMATE.init(); {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {8197#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); {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8197#true} {8197#true} #60#return; {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {8197#true} call #t~ret5 := main(); {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {8197#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; {8197#true} is VALID [2022-04-27 14:39:01,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {8197#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8197#true} {8197#true} #52#return; {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {8197#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8235#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {8235#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8235#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:01,396 INFO L272 TraceCheckUtils]: 13: Hoare triple {8235#(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)); {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,399 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8197#true} {8235#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8235#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:01,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {8235#(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; {8257#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:01,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {8257#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {8257#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:01,400 INFO L272 TraceCheckUtils]: 20: Hoare triple {8257#(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)); {8197#true} is VALID [2022-04-27 14:39:01,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,401 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8197#true} {8257#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {8257#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:01,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {8257#(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; {8279#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:01,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {8279#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {8279#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:01,401 INFO L272 TraceCheckUtils]: 27: Hoare triple {8279#(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)); {8197#true} is VALID [2022-04-27 14:39:01,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,402 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8197#true} {8279#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {8279#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:01,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {8279#(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; {8301#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:01,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {8301#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {8301#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:01,403 INFO L272 TraceCheckUtils]: 34: Hoare triple {8301#(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)); {8197#true} is VALID [2022-04-27 14:39:01,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,403 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8197#true} {8301#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {8301#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:01,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {8301#(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; {8323#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:01,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {8323#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8323#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:01,404 INFO L272 TraceCheckUtils]: 41: Hoare triple {8323#(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)); {8197#true} is VALID [2022-04-27 14:39:01,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,404 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8197#true} {8323#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8323#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:01,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {8323#(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; {8345#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:01,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {8345#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8345#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:01,405 INFO L272 TraceCheckUtils]: 48: Hoare triple {8345#(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)); {8197#true} is VALID [2022-04-27 14:39:01,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,406 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8197#true} {8345#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8345#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:01,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {8345#(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; {8367#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:01,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {8367#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {8367#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:01,406 INFO L272 TraceCheckUtils]: 55: Hoare triple {8367#(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)); {8197#true} is VALID [2022-04-27 14:39:01,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,407 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8197#true} {8367#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {8367#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:01,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {8367#(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; {8389#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:01,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {8389#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {8389#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:01,407 INFO L272 TraceCheckUtils]: 62: Hoare triple {8389#(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)); {8197#true} is VALID [2022-04-27 14:39:01,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,408 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8197#true} {8389#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {8389#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:01,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {8389#(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; {8411#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:39:01,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {8411#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {8411#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:39:01,409 INFO L272 TraceCheckUtils]: 69: Hoare triple {8411#(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)); {8197#true} is VALID [2022-04-27 14:39:01,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,409 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8197#true} {8411#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {8411#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:39:01,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {8411#(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; {8433#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:01,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {8433#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {8433#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:01,413 INFO L272 TraceCheckUtils]: 76: Hoare triple {8433#(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)); {8197#true} is VALID [2022-04-27 14:39:01,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,413 INFO L290 TraceCheckUtils]: 79: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,414 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8197#true} {8433#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {8433#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:01,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {8433#(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; {8455#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:39:01,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {8455#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {8455#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:39:01,415 INFO L272 TraceCheckUtils]: 83: Hoare triple {8455#(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)); {8197#true} is VALID [2022-04-27 14:39:01,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,415 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8197#true} {8455#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {8455#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-27 14:39:01,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {8455#(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; {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:39:01,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:39:01,416 INFO L272 TraceCheckUtils]: 90: Hoare triple {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8197#true} is VALID [2022-04-27 14:39:01,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,416 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8197#true} {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:39:01,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {8477#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:01,418 INFO L290 TraceCheckUtils]: 96: Hoare triple {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} assume !false; {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:01,418 INFO L272 TraceCheckUtils]: 97: Hoare triple {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8197#true} is VALID [2022-04-27 14:39:01,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,418 INFO L290 TraceCheckUtils]: 99: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,419 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8197#true} {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} #54#return; {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:01,419 INFO L290 TraceCheckUtils]: 102: Hoare triple {8499#(and (= main_~c~0 12) (= 7 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8521#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:39:01,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {8521#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {8521#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:39:01,420 INFO L272 TraceCheckUtils]: 104: Hoare triple {8521#(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)); {8197#true} is VALID [2022-04-27 14:39:01,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,420 INFO L290 TraceCheckUtils]: 106: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,420 INFO L290 TraceCheckUtils]: 107: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,420 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8197#true} {8521#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {8521#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:39:01,420 INFO L290 TraceCheckUtils]: 109: Hoare triple {8521#(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; {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:39:01,421 INFO L290 TraceCheckUtils]: 110: Hoare triple {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:39:01,421 INFO L272 TraceCheckUtils]: 111: Hoare triple {8543#(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)); {8197#true} is VALID [2022-04-27 14:39:01,421 INFO L290 TraceCheckUtils]: 112: Hoare triple {8197#true} ~cond := #in~cond; {8197#true} is VALID [2022-04-27 14:39:01,421 INFO L290 TraceCheckUtils]: 113: Hoare triple {8197#true} assume !(0 == ~cond); {8197#true} is VALID [2022-04-27 14:39:01,421 INFO L290 TraceCheckUtils]: 114: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-27 14:39:01,421 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8197#true} {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:39:01,422 INFO L290 TraceCheckUtils]: 116: Hoare triple {8543#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8565#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-27 14:39:01,423 INFO L272 TraceCheckUtils]: 117: Hoare triple {8565#(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)); {8569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:01,423 INFO L290 TraceCheckUtils]: 118: Hoare triple {8569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:01,423 INFO L290 TraceCheckUtils]: 119: Hoare triple {8573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8198#false} is VALID [2022-04-27 14:39:01,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {8198#false} assume !false; {8198#false} is VALID [2022-04-27 14:39:01,424 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:39:01,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129119451] [2022-04-27 14:39:01,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781536702] [2022-04-27 14:39:01,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781536702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:01,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:01,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:39:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496794030] [2022-04-27 14:39:01,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:01,738 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:39:01,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:01,739 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:39:01,791 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:39:01,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:39:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:39:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:39:01,792 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:39:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,620 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-27 14:39:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:39:03,621 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:39:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:03,621 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:39:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:39:03,622 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:39:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:39:03,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-27 14:39:03,702 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:39:03,703 INFO L225 Difference]: With dead ends: 78 [2022-04-27 14:39:03,703 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 14:39:03,703 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:39:03,704 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:03,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:39:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 14:39:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-27 14:39:03,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:03,745 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:39:03,745 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:39:03,745 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:39:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,747 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:39:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:39:03,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:03,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:03,747 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:39:03,747 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:39:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,748 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:39:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:39:03,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:03,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:03,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:03,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:03,749 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:39:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-27 14:39:03,750 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-27 14:39:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:03,750 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-27 14:39:03,750 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:39:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:39:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 14:39:03,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:03,751 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:39:03,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 14:39:03,956 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:39:03,956 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 15 times [2022-04-27 14:39:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:03,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614993504] [2022-04-27 14:39:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:03,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643250226] [2022-04-27 14:39:03,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:39:03,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:03,969 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:39:03,970 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:39:04,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:39:04,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:04,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 14:39:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:04,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:05,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {9008#true} call ULTIMATE.init(); {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {9008#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); {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9008#true} {9008#true} #60#return; {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {9008#true} call #t~ret5 := main(); {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {9008#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; {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {9008#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {9008#true} is VALID [2022-04-27 14:39:05,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9008#true} {9008#true} #52#return; {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {9008#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9046#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {9046#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9046#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,186 INFO L272 TraceCheckUtils]: 13: Hoare triple {9046#(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)); {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,187 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9008#true} {9046#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9046#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {9046#(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; {9068#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:05,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {9068#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9068#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:05,187 INFO L272 TraceCheckUtils]: 20: Hoare triple {9068#(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)); {9008#true} is VALID [2022-04-27 14:39:05,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,188 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9008#true} {9068#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9068#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:05,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {9068#(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; {9090#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:05,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {9090#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {9090#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:05,189 INFO L272 TraceCheckUtils]: 27: Hoare triple {9090#(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)); {9008#true} is VALID [2022-04-27 14:39:05,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,189 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9008#true} {9090#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {9090#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:05,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {9090#(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; {9112#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:39:05,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {9112#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {9112#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:39:05,190 INFO L272 TraceCheckUtils]: 34: Hoare triple {9112#(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)); {9008#true} is VALID [2022-04-27 14:39:05,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,190 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9008#true} {9112#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {9112#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:39:05,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {9112#(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; {9134#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {9134#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {9134#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,191 INFO L272 TraceCheckUtils]: 41: Hoare triple {9134#(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)); {9008#true} is VALID [2022-04-27 14:39:05,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,194 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9008#true} {9134#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {9134#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {9134#(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; {9156#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:39:05,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {9156#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {9156#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:39:05,195 INFO L272 TraceCheckUtils]: 48: Hoare triple {9156#(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)); {9008#true} is VALID [2022-04-27 14:39:05,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,196 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9008#true} {9156#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {9156#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:39:05,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {9156#(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; {9178#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:05,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {9178#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {9178#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:05,197 INFO L272 TraceCheckUtils]: 55: Hoare triple {9178#(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)); {9008#true} is VALID [2022-04-27 14:39:05,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,197 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9008#true} {9178#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {9178#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:05,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {9178#(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; {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,198 INFO L272 TraceCheckUtils]: 62: Hoare triple {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9008#true} is VALID [2022-04-27 14:39:05,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,198 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9008#true} {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:05,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {9200#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:05,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !false; {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:05,199 INFO L272 TraceCheckUtils]: 69: Hoare triple {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9008#true} is VALID [2022-04-27 14:39:05,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,199 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9008#true} {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} #54#return; {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:05,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {9222#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9244#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:05,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {9244#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !false; {9244#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:05,200 INFO L272 TraceCheckUtils]: 76: Hoare triple {9244#(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)); {9008#true} is VALID [2022-04-27 14:39:05,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,201 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9008#true} {9244#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} #54#return; {9244#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:05,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {9244#(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; {9266#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:39:05,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {9266#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} assume !false; {9266#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:39:05,201 INFO L272 TraceCheckUtils]: 83: Hoare triple {9266#(and (= 5 (+ main_~c~0 (- 5))) (= 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)); {9008#true} is VALID [2022-04-27 14:39:05,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,202 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9008#true} {9266#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} #54#return; {9266#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-27 14:39:05,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {9266#(and (= 5 (+ main_~c~0 (- 5))) (= 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; {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:05,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} assume !false; {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:05,203 INFO L272 TraceCheckUtils]: 90: Hoare triple {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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)); {9008#true} is VALID [2022-04-27 14:39:05,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,203 INFO L290 TraceCheckUtils]: 92: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,203 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9008#true} {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} #54#return; {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:05,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {9288#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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; {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:39:05,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} assume !false; {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:39:05,204 INFO L272 TraceCheckUtils]: 97: Hoare triple {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ 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)); {9008#true} is VALID [2022-04-27 14:39:05,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,204 INFO L290 TraceCheckUtils]: 99: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,204 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9008#true} {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} #54#return; {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:39:05,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {9310#(and (= (+ (- 2) main_~y~0) 10) (= (+ 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; {9332#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:05,205 INFO L290 TraceCheckUtils]: 103: Hoare triple {9332#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {9332#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:05,205 INFO L272 TraceCheckUtils]: 104: Hoare triple {9332#(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)); {9008#true} is VALID [2022-04-27 14:39:05,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,205 INFO L290 TraceCheckUtils]: 107: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,205 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9008#true} {9332#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {9332#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:05,206 INFO L290 TraceCheckUtils]: 109: Hoare triple {9332#(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; {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:05,206 INFO L290 TraceCheckUtils]: 110: Hoare triple {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:05,206 INFO L272 TraceCheckUtils]: 111: Hoare triple {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9008#true} is VALID [2022-04-27 14:39:05,206 INFO L290 TraceCheckUtils]: 112: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,206 INFO L290 TraceCheckUtils]: 113: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,206 INFO L290 TraceCheckUtils]: 114: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,207 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9008#true} {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:05,207 INFO L290 TraceCheckUtils]: 116: Hoare triple {9354#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-27 14:39:05,207 INFO L290 TraceCheckUtils]: 117: Hoare triple {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !false; {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-27 14:39:05,207 INFO L272 TraceCheckUtils]: 118: Hoare triple {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9008#true} is VALID [2022-04-27 14:39:05,208 INFO L290 TraceCheckUtils]: 119: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-27 14:39:05,208 INFO L290 TraceCheckUtils]: 120: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-27 14:39:05,208 INFO L290 TraceCheckUtils]: 121: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-27 14:39:05,208 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9008#true} {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} #54#return; {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-27 14:39:05,209 INFO L290 TraceCheckUtils]: 123: Hoare triple {9376#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9398#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} is VALID [2022-04-27 14:39:05,209 INFO L272 TraceCheckUtils]: 124: Hoare triple {9398#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:05,209 INFO L290 TraceCheckUtils]: 125: Hoare triple {9402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:05,210 INFO L290 TraceCheckUtils]: 126: Hoare triple {9406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9009#false} is VALID [2022-04-27 14:39:05,210 INFO L290 TraceCheckUtils]: 127: Hoare triple {9009#false} assume !false; {9009#false} is VALID [2022-04-27 14:39:05,210 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:39:05,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:05,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614993504] [2022-04-27 14:39:05,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643250226] [2022-04-27 14:39:05,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643250226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:05,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:05,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:39:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962901602] [2022-04-27 14:39:05,593 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:05,593 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:39:05,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:05,594 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:39:05,652 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:39:05,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:39:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:39:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:39:05,653 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:39:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:07,662 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-27 14:39:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:39:07,662 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:39:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:07,662 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:39:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:39:07,664 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:39:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:39:07,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-27 14:39:07,739 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:39:07,740 INFO L225 Difference]: With dead ends: 81 [2022-04-27 14:39:07,740 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 14:39:07,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:39:07,741 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:07,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:39:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 14:39:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 14:39:07,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:07,783 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:39:07,783 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:39:07,783 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:39:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:07,785 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:39:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:39:07,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:07,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:07,785 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:39:07,785 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:39:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:07,787 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:39:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:39:07,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:07,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:07,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:07,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:07,787 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:39:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-27 14:39:07,788 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-27 14:39:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:07,789 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-27 14:39:07,789 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:39:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:39:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-27 14:39:07,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:07,789 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:39:07,795 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:39:07,995 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:39:07,995 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:07,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 16 times [2022-04-27 14:39:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015238263] [2022-04-27 14:39:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:08,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:08,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804217096] [2022-04-27 14:39:08,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:39:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:08,007 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:39:08,008 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:39:08,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:39:08,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:08,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-27 14:39:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:08,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:09,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {9857#true} call ULTIMATE.init(); {9857#true} is VALID [2022-04-27 14:39:09,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {9857#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); {9857#true} is VALID [2022-04-27 14:39:09,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9857#true} {9857#true} #60#return; {9857#true} is VALID [2022-04-27 14:39:09,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {9857#true} call #t~ret5 := main(); {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {9857#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; {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {9857#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9857#true} {9857#true} #52#return; {9857#true} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {9857#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9895#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:09,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {9895#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9895#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:09,156 INFO L272 TraceCheckUtils]: 13: Hoare triple {9895#(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)); {9857#true} is VALID [2022-04-27 14:39:09,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,156 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9857#true} {9895#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9895#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:09,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {9895#(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; {9917#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:09,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {9917#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {9917#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:09,157 INFO L272 TraceCheckUtils]: 20: Hoare triple {9917#(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)); {9857#true} is VALID [2022-04-27 14:39:09,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,157 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9857#true} {9917#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {9917#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:09,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {9917#(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; {9939#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:09,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {9939#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9939#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:09,158 INFO L272 TraceCheckUtils]: 27: Hoare triple {9939#(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)); {9857#true} is VALID [2022-04-27 14:39:09,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,159 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9857#true} {9939#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9939#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:09,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {9939#(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; {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:39:09,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:39:09,159 INFO L272 TraceCheckUtils]: 34: Hoare triple {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9857#true} is VALID [2022-04-27 14:39:09,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,160 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9857#true} {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:39:09,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {9961#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9983#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:09,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {9983#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {9983#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:09,160 INFO L272 TraceCheckUtils]: 41: Hoare triple {9983#(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)); {9857#true} is VALID [2022-04-27 14:39:09,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,179 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9857#true} {9983#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {9983#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:39:09,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {9983#(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; {10005#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:09,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {10005#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {10005#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:09,180 INFO L272 TraceCheckUtils]: 48: Hoare triple {10005#(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)); {9857#true} is VALID [2022-04-27 14:39:09,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,181 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9857#true} {10005#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {10005#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:09,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {10005#(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; {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:09,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:09,182 INFO L272 TraceCheckUtils]: 55: Hoare triple {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9857#true} is VALID [2022-04-27 14:39:09,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,182 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9857#true} {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:09,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {10027#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:09,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {10049#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {10049#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:09,183 INFO L272 TraceCheckUtils]: 62: Hoare triple {10049#(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)); {9857#true} is VALID [2022-04-27 14:39:09,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,184 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9857#true} {10049#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {10049#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:39:09,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {10049#(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; {10071#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:39:09,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {10071#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {10071#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:39:09,185 INFO L272 TraceCheckUtils]: 69: Hoare triple {10071#(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)); {9857#true} is VALID [2022-04-27 14:39:09,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,185 INFO L290 TraceCheckUtils]: 71: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,185 INFO L290 TraceCheckUtils]: 72: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,185 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9857#true} {10071#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {10071#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:39:09,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {10071#(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; {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:09,186 INFO L290 TraceCheckUtils]: 75: Hoare triple {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:09,186 INFO L272 TraceCheckUtils]: 76: Hoare triple {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9857#true} is VALID [2022-04-27 14:39:09,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,186 INFO L290 TraceCheckUtils]: 78: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,186 INFO L290 TraceCheckUtils]: 79: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,187 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9857#true} {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:09,187 INFO L290 TraceCheckUtils]: 81: Hoare triple {10093#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10115#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:39:09,187 INFO L290 TraceCheckUtils]: 82: Hoare triple {10115#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {10115#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:39:09,187 INFO L272 TraceCheckUtils]: 83: Hoare triple {10115#(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)); {9857#true} is VALID [2022-04-27 14:39:09,188 INFO L290 TraceCheckUtils]: 84: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,188 INFO L290 TraceCheckUtils]: 85: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,188 INFO L290 TraceCheckUtils]: 86: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,188 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9857#true} {10115#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {10115#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:39:09,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {10115#(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; {10137#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:09,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {10137#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {10137#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:09,189 INFO L272 TraceCheckUtils]: 90: Hoare triple {10137#(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)); {9857#true} is VALID [2022-04-27 14:39:09,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,189 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9857#true} {10137#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {10137#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:09,190 INFO L290 TraceCheckUtils]: 95: Hoare triple {10137#(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; {10159#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:39:09,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {10159#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {10159#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:39:09,190 INFO L272 TraceCheckUtils]: 97: Hoare triple {10159#(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)); {9857#true} is VALID [2022-04-27 14:39:09,190 INFO L290 TraceCheckUtils]: 98: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,191 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9857#true} {10159#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {10159#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:39:09,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {10159#(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; {10181#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:09,192 INFO L290 TraceCheckUtils]: 103: Hoare triple {10181#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !false; {10181#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:09,192 INFO L272 TraceCheckUtils]: 104: Hoare triple {10181#(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)); {9857#true} is VALID [2022-04-27 14:39:09,192 INFO L290 TraceCheckUtils]: 105: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,192 INFO L290 TraceCheckUtils]: 106: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,192 INFO L290 TraceCheckUtils]: 107: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,192 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9857#true} {10181#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} #54#return; {10181#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:09,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {10181#(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; {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:09,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} assume !false; {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:09,193 INFO L272 TraceCheckUtils]: 111: Hoare triple {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9857#true} is VALID [2022-04-27 14:39:09,193 INFO L290 TraceCheckUtils]: 112: Hoare triple {9857#true} ~cond := #in~cond; {9857#true} is VALID [2022-04-27 14:39:09,193 INFO L290 TraceCheckUtils]: 113: Hoare triple {9857#true} assume !(0 == ~cond); {9857#true} is VALID [2022-04-27 14:39:09,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {9857#true} assume true; {9857#true} is VALID [2022-04-27 14:39:09,194 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9857#true} {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} #54#return; {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:09,194 INFO L290 TraceCheckUtils]: 116: Hoare triple {10203#(and (= (+ main_~c~0 (- 3)) 11) (= (+ main_~y~0 (- 4)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10225#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15))} is VALID [2022-04-27 14:39:09,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {10225#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15))} assume !false; {10225#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15))} is VALID [2022-04-27 14:39:09,194 INFO L272 TraceCheckUtils]: 118: Hoare triple {10225#(and (= (+ main_~y~0 (- 5)) 10) (= 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)); {9857#true} is VALID [2022-04-27 14:39:09,195 INFO L290 TraceCheckUtils]: 119: Hoare triple {9857#true} ~cond := #in~cond; {10235#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:09,195 INFO L290 TraceCheckUtils]: 120: Hoare triple {10235#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:39:09,195 INFO L290 TraceCheckUtils]: 121: Hoare triple {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:39:09,196 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} {10225#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15))} #54#return; {10246#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15) (= (+ (* 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:39:09,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {10246#(and (= (+ main_~y~0 (- 5)) 10) (= main_~c~0 15) (= (+ (* 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; {10250#(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:39:09,197 INFO L290 TraceCheckUtils]: 124: Hoare triple {10250#(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; {10250#(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:39:09,197 INFO L272 TraceCheckUtils]: 125: Hoare triple {10250#(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)); {9857#true} is VALID [2022-04-27 14:39:09,197 INFO L290 TraceCheckUtils]: 126: Hoare triple {9857#true} ~cond := #in~cond; {10235#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:09,197 INFO L290 TraceCheckUtils]: 127: Hoare triple {10235#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:39:09,198 INFO L290 TraceCheckUtils]: 128: Hoare triple {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:39:09,198 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10239#(not (= |__VERIFIER_assert_#in~cond| 0))} {10250#(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; {10269#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:39:09,199 INFO L290 TraceCheckUtils]: 130: Hoare triple {10269#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10273#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-27 14:39:09,200 INFO L272 TraceCheckUtils]: 131: Hoare triple {10273#(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)); {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:09,200 INFO L290 TraceCheckUtils]: 132: Hoare triple {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:09,201 INFO L290 TraceCheckUtils]: 133: Hoare triple {10281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9858#false} is VALID [2022-04-27 14:39:09,201 INFO L290 TraceCheckUtils]: 134: Hoare triple {9858#false} assume !false; {9858#false} is VALID [2022-04-27 14:39:09,201 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:39:09,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:27,613 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:39:31,779 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:39:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015238263] [2022-04-27 14:39:31,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:31,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804217096] [2022-04-27 14:39:31,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804217096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:31,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:31,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 14:39:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701064761] [2022-04-27 14:39:31,782 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:31,782 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:39:31,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:31,782 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:39:31,849 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:39:31,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:39:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:39:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=796, Unknown=2, NotChecked=114, Total=992 [2022-04-27 14:39:31,850 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:39:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:34,709 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-27 14:39:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:39:34,709 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:39:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:34,710 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:39:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:39:34,711 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:39:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:39:34,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 96 transitions. [2022-04-27 14:39:34,814 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:39:34,815 INFO L225 Difference]: With dead ends: 84 [2022-04-27 14:39:34,815 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 14:39:34,816 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:39:34,816 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:34,816 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.4s Time] [2022-04-27 14:39:34,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 14:39:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 14:39:34,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:34,863 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:39:34,863 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:39:34,863 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:39:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:34,864 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:39:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:39:34,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:34,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:34,865 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:39:34,865 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:39:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:34,866 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:39:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:39:34,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:34,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:34,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:34,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:34,867 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:39:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 14:39:34,868 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-27 14:39:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:34,868 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 14:39:34,868 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:39:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:39:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-27 14:39:34,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:34,869 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:39:34,879 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:39:35,073 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:39:35,074 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 17 times [2022-04-27 14:39:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:35,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096784605] [2022-04-27 14:39:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:35,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:35,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160591339] [2022-04-27 14:39:35,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:39:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:35,087 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:39:35,087 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:39:36,206 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-04-27 14:39:36,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:36,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-27 14:39:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:36,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:36,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {10753#true} call ULTIMATE.init(); {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {10753#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); {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10753#true} {10753#true} #60#return; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {10753#true} call #t~ret5 := main(); {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {10753#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; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {10753#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10753#true} {10753#true} #52#return; {10753#true} is VALID [2022-04-27 14:39:36,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {10753#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10791#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:36,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {10791#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10791#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:36,926 INFO L272 TraceCheckUtils]: 13: Hoare triple {10791#(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)); {10753#true} is VALID [2022-04-27 14:39:36,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,926 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10753#true} {10791#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10791#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:36,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {10791#(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; {10813#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:36,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {10813#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {10813#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:36,927 INFO L272 TraceCheckUtils]: 20: Hoare triple {10813#(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)); {10753#true} is VALID [2022-04-27 14:39:36,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,927 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10753#true} {10813#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {10813#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:39:36,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {10813#(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; {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,929 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10753#true} {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {10835#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10857#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:36,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {10857#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {10857#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:36,929 INFO L272 TraceCheckUtils]: 34: Hoare triple {10857#(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)); {10753#true} is VALID [2022-04-27 14:39:36,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,930 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10753#true} {10857#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {10857#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:36,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {10857#(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; {10879#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:36,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {10879#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {10879#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:36,931 INFO L272 TraceCheckUtils]: 41: Hoare triple {10879#(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)); {10753#true} is VALID [2022-04-27 14:39:36,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,931 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10753#true} {10879#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {10879#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:36,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {10879#(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; {10901#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:36,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {10901#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {10901#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:36,932 INFO L272 TraceCheckUtils]: 48: Hoare triple {10901#(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)); {10753#true} is VALID [2022-04-27 14:39:36,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,932 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10753#true} {10901#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {10901#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:36,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {10901#(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; {10923#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:39:36,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {10923#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {10923#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:39:36,933 INFO L272 TraceCheckUtils]: 55: Hoare triple {10923#(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)); {10753#true} is VALID [2022-04-27 14:39:36,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,933 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10753#true} {10923#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {10923#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:39:36,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {10923#(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; {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,934 INFO L272 TraceCheckUtils]: 62: Hoare triple {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,935 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10753#true} {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {10945#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:36,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:36,935 INFO L272 TraceCheckUtils]: 69: Hoare triple {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,936 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10753#true} {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:36,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {10967#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:36,936 INFO L290 TraceCheckUtils]: 75: Hoare triple {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:36,937 INFO L272 TraceCheckUtils]: 76: Hoare triple {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,937 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10753#true} {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:39:36,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {10989#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,938 INFO L290 TraceCheckUtils]: 82: Hoare triple {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,938 INFO L272 TraceCheckUtils]: 83: Hoare triple {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,938 INFO L290 TraceCheckUtils]: 84: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,938 INFO L290 TraceCheckUtils]: 85: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,938 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10753#true} {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #54#return; {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:36,939 INFO L290 TraceCheckUtils]: 88: Hoare triple {11011#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:36,939 INFO L290 TraceCheckUtils]: 89: Hoare triple {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 1) main_~y~0) 10))} assume !false; {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:36,939 INFO L272 TraceCheckUtils]: 90: Hoare triple {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 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)); {10753#true} is VALID [2022-04-27 14:39:36,939 INFO L290 TraceCheckUtils]: 91: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,939 INFO L290 TraceCheckUtils]: 92: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,939 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10753#true} {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 1) main_~y~0) 10))} #54#return; {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:39:36,940 INFO L290 TraceCheckUtils]: 95: Hoare triple {11033#(and (= (+ main_~c~0 (- 3)) 8) (= (+ (- 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; {11055#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:39:36,940 INFO L290 TraceCheckUtils]: 96: Hoare triple {11055#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {11055#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:39:36,940 INFO L272 TraceCheckUtils]: 97: Hoare triple {11055#(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)); {10753#true} is VALID [2022-04-27 14:39:36,940 INFO L290 TraceCheckUtils]: 98: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,940 INFO L290 TraceCheckUtils]: 99: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,940 INFO L290 TraceCheckUtils]: 100: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,941 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10753#true} {11055#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #54#return; {11055#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 14:39:36,941 INFO L290 TraceCheckUtils]: 102: Hoare triple {11055#(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; {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:36,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !false; {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:36,941 INFO L272 TraceCheckUtils]: 104: Hoare triple {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,941 INFO L290 TraceCheckUtils]: 107: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,942 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10753#true} {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} #54#return; {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:39:36,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {11077#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:36,942 INFO L290 TraceCheckUtils]: 110: Hoare triple {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !false; {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:36,942 INFO L272 TraceCheckUtils]: 111: Hoare triple {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,943 INFO L290 TraceCheckUtils]: 112: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,943 INFO L290 TraceCheckUtils]: 113: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,943 INFO L290 TraceCheckUtils]: 114: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,943 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10753#true} {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} #54#return; {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-27 14:39:36,943 INFO L290 TraceCheckUtils]: 116: Hoare triple {11099#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:39:36,944 INFO L290 TraceCheckUtils]: 117: Hoare triple {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:39:36,944 INFO L272 TraceCheckUtils]: 118: Hoare triple {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10753#true} is VALID [2022-04-27 14:39:36,944 INFO L290 TraceCheckUtils]: 119: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,944 INFO L290 TraceCheckUtils]: 120: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,944 INFO L290 TraceCheckUtils]: 121: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,944 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10753#true} {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:39:36,945 INFO L290 TraceCheckUtils]: 123: Hoare triple {11121#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11143#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,945 INFO L290 TraceCheckUtils]: 124: Hoare triple {11143#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {11143#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,945 INFO L272 TraceCheckUtils]: 125: Hoare triple {11143#(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)); {10753#true} is VALID [2022-04-27 14:39:36,945 INFO L290 TraceCheckUtils]: 126: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,945 INFO L290 TraceCheckUtils]: 127: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,945 INFO L290 TraceCheckUtils]: 128: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,946 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10753#true} {11143#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {11143#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:36,946 INFO L290 TraceCheckUtils]: 130: Hoare triple {11143#(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; {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:39:36,946 INFO L290 TraceCheckUtils]: 131: Hoare triple {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:39:36,946 INFO L272 TraceCheckUtils]: 132: Hoare triple {11165#(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)); {10753#true} is VALID [2022-04-27 14:39:36,947 INFO L290 TraceCheckUtils]: 133: Hoare triple {10753#true} ~cond := #in~cond; {10753#true} is VALID [2022-04-27 14:39:36,947 INFO L290 TraceCheckUtils]: 134: Hoare triple {10753#true} assume !(0 == ~cond); {10753#true} is VALID [2022-04-27 14:39:36,947 INFO L290 TraceCheckUtils]: 135: Hoare triple {10753#true} assume true; {10753#true} is VALID [2022-04-27 14:39:36,947 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {10753#true} {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:39:36,948 INFO L290 TraceCheckUtils]: 137: Hoare triple {11165#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {11187#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:39:36,949 INFO L272 TraceCheckUtils]: 138: Hoare triple {11187#(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)); {11191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:36,949 INFO L290 TraceCheckUtils]: 139: Hoare triple {11191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:36,949 INFO L290 TraceCheckUtils]: 140: Hoare triple {11195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10754#false} is VALID [2022-04-27 14:39:36,950 INFO L290 TraceCheckUtils]: 141: Hoare triple {10754#false} assume !false; {10754#false} is VALID [2022-04-27 14:39:36,950 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:39:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096784605] [2022-04-27 14:39:37,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160591339] [2022-04-27 14:39:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160591339] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:37,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:37,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:39:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036720171] [2022-04-27 14:39:37,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:37,274 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:39:37,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:37,274 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:39:37,351 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:39:37,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:39:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:39:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:39:37,352 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:39:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:40,001 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-27 14:39:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 14:39:40,001 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:39:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:40,001 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:39:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:39:40,003 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:39:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:39:40,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-27 14:39:40,108 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:39:40,111 INFO L225 Difference]: With dead ends: 87 [2022-04-27 14:39:40,111 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 14:39:40,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:39:40,113 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:40,113 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.3s Time] [2022-04-27 14:39:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 14:39:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 14:39:40,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:40,163 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:39:40,163 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:39:40,163 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:39:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:40,165 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:39:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:39:40,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:40,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:40,165 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:39:40,165 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:39:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:40,166 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:39:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:39:40,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:40,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:40,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:40,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:40,167 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:39:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-27 14:39:40,168 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-27 14:39:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:40,168 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-27 14:39:40,168 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:39:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:39:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-27 14:39:40,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:40,169 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:39:40,185 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:39:40,376 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:39:40,376 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 18 times [2022-04-27 14:39:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:40,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601869784] [2022-04-27 14:39:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:40,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:40,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319850242] [2022-04-27 14:39:40,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:39:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:40,389 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:39:40,390 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:39:50,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-27 14:39:50,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:50,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-27 14:39:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:51,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:51,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {11678#true} call ULTIMATE.init(); {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {11678#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); {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11678#true} {11678#true} #60#return; {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {11678#true} call #t~ret5 := main(); {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {11678#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; {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {11678#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11678#true} {11678#true} #52#return; {11678#true} is VALID [2022-04-27 14:39:51,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {11678#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:51,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {11716#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:51,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {11716#(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)); {11678#true} is VALID [2022-04-27 14:39:51,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,750 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11678#true} {11716#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:51,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {11716#(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; {11738#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:51,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {11738#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {11738#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:51,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {11738#(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)); {11678#true} is VALID [2022-04-27 14:39:51,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,751 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11678#true} {11738#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {11738#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:51,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {11738#(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; {11760#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:39:51,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {11760#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {11760#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:39:51,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {11760#(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)); {11678#true} is VALID [2022-04-27 14:39:51,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,752 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11678#true} {11760#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {11760#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:39:51,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {11760#(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; {11782#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:51,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {11782#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {11782#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:51,753 INFO L272 TraceCheckUtils]: 34: Hoare triple {11782#(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)); {11678#true} is VALID [2022-04-27 14:39:51,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,753 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11678#true} {11782#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {11782#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:39:51,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {11782#(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; {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:51,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:51,756 INFO L272 TraceCheckUtils]: 41: Hoare triple {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,759 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11678#true} {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:39:51,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {11804#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11826#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:51,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {11826#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {11826#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:51,760 INFO L272 TraceCheckUtils]: 48: Hoare triple {11826#(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)); {11678#true} is VALID [2022-04-27 14:39:51,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,760 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11678#true} {11826#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {11826#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:51,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {11826#(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; {11848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:51,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {11848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {11848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:51,761 INFO L272 TraceCheckUtils]: 55: Hoare triple {11848#(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)); {11678#true} is VALID [2022-04-27 14:39:51,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,761 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11678#true} {11848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {11848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:51,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {11848#(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; {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:51,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:51,762 INFO L272 TraceCheckUtils]: 62: Hoare triple {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,763 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11678#true} {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:51,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {11870#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:51,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !false; {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:51,763 INFO L272 TraceCheckUtils]: 69: Hoare triple {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,764 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11678#true} {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} #54#return; {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:39:51,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {11892#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:51,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 5 (+ main_~c~0 (- 4))))} assume !false; {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:51,765 INFO L272 TraceCheckUtils]: 76: Hoare triple {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 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)); {11678#true} is VALID [2022-04-27 14:39:51,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,765 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11678#true} {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 5 (+ main_~c~0 (- 4))))} #54#return; {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:39:51,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {11914#(and (= (+ main_~y~0 (- 3)) 6) (= 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; {11936#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:39:51,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {11936#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} assume !false; {11936#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:39:51,766 INFO L272 TraceCheckUtils]: 83: Hoare triple {11936#(and (= (+ main_~y~0 (- 4)) 6) (= 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)); {11678#true} is VALID [2022-04-27 14:39:51,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,766 INFO L290 TraceCheckUtils]: 86: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,766 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11678#true} {11936#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} #54#return; {11936#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:39:51,767 INFO L290 TraceCheckUtils]: 88: Hoare triple {11936#(and (= (+ main_~y~0 (- 4)) 6) (= 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; {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:51,767 INFO L290 TraceCheckUtils]: 89: Hoare triple {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} assume !false; {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:51,767 INFO L272 TraceCheckUtils]: 90: Hoare triple {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,767 INFO L290 TraceCheckUtils]: 91: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,767 INFO L290 TraceCheckUtils]: 92: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,768 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11678#true} {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} #54#return; {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:39:51,768 INFO L290 TraceCheckUtils]: 95: Hoare triple {11958#(and (= (+ (- 1) main_~c~0) 10) (= 6 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11980#(and (= main_~c~0 12) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:39:51,768 INFO L290 TraceCheckUtils]: 96: Hoare triple {11980#(and (= main_~c~0 12) (= (+ main_~y~0 (- 6)) 6))} assume !false; {11980#(and (= main_~c~0 12) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:39:51,768 INFO L272 TraceCheckUtils]: 97: Hoare triple {11980#(and (= main_~c~0 12) (= (+ 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)); {11678#true} is VALID [2022-04-27 14:39:51,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,768 INFO L290 TraceCheckUtils]: 99: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,768 INFO L290 TraceCheckUtils]: 100: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,769 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11678#true} {11980#(and (= main_~c~0 12) (= (+ main_~y~0 (- 6)) 6))} #54#return; {11980#(and (= main_~c~0 12) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:39:51,769 INFO L290 TraceCheckUtils]: 102: Hoare triple {11980#(and (= main_~c~0 12) (= (+ 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; {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 12))} is VALID [2022-04-27 14:39:51,769 INFO L290 TraceCheckUtils]: 103: Hoare triple {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 12))} assume !false; {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 12))} is VALID [2022-04-27 14:39:51,769 INFO L272 TraceCheckUtils]: 104: Hoare triple {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) 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)); {11678#true} is VALID [2022-04-27 14:39:51,770 INFO L290 TraceCheckUtils]: 105: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,770 INFO L290 TraceCheckUtils]: 106: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,770 INFO L290 TraceCheckUtils]: 107: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,770 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11678#true} {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 12))} #54#return; {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 12))} is VALID [2022-04-27 14:39:51,770 INFO L290 TraceCheckUtils]: 109: Hoare triple {12002#(and (= 6 (+ main_~y~0 (- 7))) (= (+ (- 1) 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; {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:39:51,771 INFO L290 TraceCheckUtils]: 110: Hoare triple {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 8))))} assume !false; {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:39:51,771 INFO L272 TraceCheckUtils]: 111: Hoare triple {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 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)); {11678#true} is VALID [2022-04-27 14:39:51,771 INFO L290 TraceCheckUtils]: 112: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,771 INFO L290 TraceCheckUtils]: 113: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,771 INFO L290 TraceCheckUtils]: 114: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,783 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11678#true} {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 8))))} #54#return; {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:39:51,784 INFO L290 TraceCheckUtils]: 116: Hoare triple {12024#(and (= 12 (+ (- 2) main_~c~0)) (= 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; {12046#(and (= main_~c~0 15) (= (+ (- 9) main_~y~0) 6))} is VALID [2022-04-27 14:39:51,784 INFO L290 TraceCheckUtils]: 117: Hoare triple {12046#(and (= main_~c~0 15) (= (+ (- 9) main_~y~0) 6))} assume !false; {12046#(and (= main_~c~0 15) (= (+ (- 9) main_~y~0) 6))} is VALID [2022-04-27 14:39:51,784 INFO L272 TraceCheckUtils]: 118: Hoare triple {12046#(and (= main_~c~0 15) (= (+ (- 9) 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)); {11678#true} is VALID [2022-04-27 14:39:51,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,784 INFO L290 TraceCheckUtils]: 121: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,785 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11678#true} {12046#(and (= main_~c~0 15) (= (+ (- 9) main_~y~0) 6))} #54#return; {12046#(and (= main_~c~0 15) (= (+ (- 9) main_~y~0) 6))} is VALID [2022-04-27 14:39:51,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {12046#(and (= main_~c~0 15) (= (+ (- 9) 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; {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ main_~y~0 (- 10))))} is VALID [2022-04-27 14:39:51,785 INFO L290 TraceCheckUtils]: 124: Hoare triple {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ main_~y~0 (- 10))))} assume !false; {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ main_~y~0 (- 10))))} is VALID [2022-04-27 14:39:51,786 INFO L272 TraceCheckUtils]: 125: Hoare triple {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ 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)); {11678#true} is VALID [2022-04-27 14:39:51,786 INFO L290 TraceCheckUtils]: 126: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,786 INFO L290 TraceCheckUtils]: 127: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,786 INFO L290 TraceCheckUtils]: 128: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,786 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11678#true} {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ main_~y~0 (- 10))))} #54#return; {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ main_~y~0 (- 10))))} is VALID [2022-04-27 14:39:51,786 INFO L290 TraceCheckUtils]: 130: Hoare triple {12068#(and (= (+ (- 1) main_~c~0) 15) (= 6 (+ 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; {12090#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:39:51,787 INFO L290 TraceCheckUtils]: 131: Hoare triple {12090#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {12090#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:39:51,787 INFO L272 TraceCheckUtils]: 132: Hoare triple {12090#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11678#true} is VALID [2022-04-27 14:39:51,787 INFO L290 TraceCheckUtils]: 133: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,787 INFO L290 TraceCheckUtils]: 134: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,787 INFO L290 TraceCheckUtils]: 135: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,787 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11678#true} {12090#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {12090#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:39:51,788 INFO L290 TraceCheckUtils]: 137: Hoare triple {12090#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:39:51,788 INFO L290 TraceCheckUtils]: 138: Hoare triple {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:39:51,788 INFO L272 TraceCheckUtils]: 139: Hoare triple {12112#(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)); {11678#true} is VALID [2022-04-27 14:39:51,788 INFO L290 TraceCheckUtils]: 140: Hoare triple {11678#true} ~cond := #in~cond; {11678#true} is VALID [2022-04-27 14:39:51,788 INFO L290 TraceCheckUtils]: 141: Hoare triple {11678#true} assume !(0 == ~cond); {11678#true} is VALID [2022-04-27 14:39:51,788 INFO L290 TraceCheckUtils]: 142: Hoare triple {11678#true} assume true; {11678#true} is VALID [2022-04-27 14:39:51,788 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {11678#true} {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:39:51,790 INFO L290 TraceCheckUtils]: 144: Hoare triple {12112#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {12134#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:39:51,790 INFO L272 TraceCheckUtils]: 145: Hoare triple {12134#(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)); {12138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:51,790 INFO L290 TraceCheckUtils]: 146: Hoare triple {12138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:51,791 INFO L290 TraceCheckUtils]: 147: Hoare triple {12142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11679#false} is VALID [2022-04-27 14:39:51,791 INFO L290 TraceCheckUtils]: 148: Hoare triple {11679#false} assume !false; {11679#false} is VALID [2022-04-27 14:39:51,791 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:39:51,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601869784] [2022-04-27 14:39:52,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319850242] [2022-04-27 14:39:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319850242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:52,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:52,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-27 14:39:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207276951] [2022-04-27 14:39:52,069 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:52,070 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:39:52,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:52,070 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:39:52,146 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:39:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:39:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:39:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:39:52,147 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:39:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:55,117 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-27 14:39:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 14:39:55,117 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:39:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:39:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:39:55,119 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:39:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:39:55,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-27 14:39:55,206 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:39:55,208 INFO L225 Difference]: With dead ends: 90 [2022-04-27 14:39:55,208 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 14:39:55,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-27 14:39:55,208 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:55,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 14:39:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 14:39:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-27 14:39:55,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:55,260 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:39:55,260 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:39:55,260 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:39:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:55,262 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:39:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:39:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:55,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:55,263 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:39:55,263 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:39:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:55,264 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:39:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:39:55,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:55,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:55,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:55,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:55,264 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:39:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-27 14:39:55,266 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-27 14:39:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:55,266 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-27 14:39:55,266 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:39:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:39:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-27 14:39:55,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:55,267 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:39:55,276 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:39:55,473 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:39:55,474 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 19 times [2022-04-27 14:39:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:55,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359018276] [2022-04-27 14:39:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:55,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:55,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723534247] [2022-04-27 14:39:55,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:39:55,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:55,486 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:39:55,492 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:39:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:56,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-27 14:39:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:56,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:56,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {12641#true} call ULTIMATE.init(); {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {12641#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); {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12641#true} {12641#true} #60#return; {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {12641#true} call #t~ret5 := main(); {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {12641#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; {12641#true} is VALID [2022-04-27 14:39:56,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {12641#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12641#true} {12641#true} #52#return; {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {12641#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {12679#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:56,951 INFO L272 TraceCheckUtils]: 13: Hoare triple {12679#(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)); {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,952 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12641#true} {12679#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:56,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {12679#(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; {12701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:56,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {12701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:56,952 INFO L272 TraceCheckUtils]: 20: Hoare triple {12701#(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)); {12641#true} is VALID [2022-04-27 14:39:56,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,953 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12641#true} {12701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:39:56,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {12701#(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; {12723#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:56,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {12723#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {12723#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:56,954 INFO L272 TraceCheckUtils]: 27: Hoare triple {12723#(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)); {12641#true} is VALID [2022-04-27 14:39:56,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12641#true} {12723#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {12723#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:39:56,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {12723#(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; {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:56,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:56,959 INFO L272 TraceCheckUtils]: 34: Hoare triple {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,960 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12641#true} {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #54#return; {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:56,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {12745#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12767#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:56,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {12767#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {12767#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:56,961 INFO L272 TraceCheckUtils]: 41: Hoare triple {12767#(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)); {12641#true} is VALID [2022-04-27 14:39:56,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,961 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12641#true} {12767#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {12767#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:56,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {12767#(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; {12789#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:39:56,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {12789#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {12789#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:39:56,962 INFO L272 TraceCheckUtils]: 48: Hoare triple {12789#(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)); {12641#true} is VALID [2022-04-27 14:39:56,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,962 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12641#true} {12789#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {12789#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:39:56,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {12789#(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; {12811#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:56,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {12811#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {12811#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:56,963 INFO L272 TraceCheckUtils]: 55: Hoare triple {12811#(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)); {12641#true} is VALID [2022-04-27 14:39:56,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,963 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12641#true} {12811#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {12811#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:39:56,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {12811#(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; {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,964 INFO L272 TraceCheckUtils]: 62: Hoare triple {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,965 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12641#true} {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,965 INFO L290 TraceCheckUtils]: 67: Hoare triple {12833#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:56,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:56,965 INFO L272 TraceCheckUtils]: 69: Hoare triple {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,966 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12641#true} {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:39:56,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {12855#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:39:56,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {12877#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {12877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:39:56,966 INFO L272 TraceCheckUtils]: 76: Hoare triple {12877#(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)); {12641#true} is VALID [2022-04-27 14:39:56,966 INFO L290 TraceCheckUtils]: 77: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,967 INFO L290 TraceCheckUtils]: 79: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,967 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12641#true} {12877#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {12877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:39:56,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {12877#(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; {12899#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:39:56,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {12899#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {12899#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:39:56,968 INFO L272 TraceCheckUtils]: 83: Hoare triple {12899#(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)); {12641#true} is VALID [2022-04-27 14:39:56,968 INFO L290 TraceCheckUtils]: 84: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,968 INFO L290 TraceCheckUtils]: 85: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,968 INFO L290 TraceCheckUtils]: 86: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,968 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12641#true} {12899#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {12899#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:39:56,968 INFO L290 TraceCheckUtils]: 88: Hoare triple {12899#(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; {12921#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:39:56,969 INFO L290 TraceCheckUtils]: 89: Hoare triple {12921#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {12921#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:39:56,969 INFO L272 TraceCheckUtils]: 90: Hoare triple {12921#(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)); {12641#true} is VALID [2022-04-27 14:39:56,969 INFO L290 TraceCheckUtils]: 91: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,969 INFO L290 TraceCheckUtils]: 92: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,969 INFO L290 TraceCheckUtils]: 93: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,969 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12641#true} {12921#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {12921#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:39:56,970 INFO L290 TraceCheckUtils]: 95: Hoare triple {12921#(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; {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:39:56,970 INFO L290 TraceCheckUtils]: 96: Hoare triple {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:39:56,970 INFO L272 TraceCheckUtils]: 97: Hoare triple {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,970 INFO L290 TraceCheckUtils]: 98: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,970 INFO L290 TraceCheckUtils]: 99: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,970 INFO L290 TraceCheckUtils]: 100: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,970 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12641#true} {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:39:56,971 INFO L290 TraceCheckUtils]: 102: Hoare triple {12943#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12965#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:56,971 INFO L290 TraceCheckUtils]: 103: Hoare triple {12965#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {12965#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:56,971 INFO L272 TraceCheckUtils]: 104: Hoare triple {12965#(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)); {12641#true} is VALID [2022-04-27 14:39:56,971 INFO L290 TraceCheckUtils]: 105: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,971 INFO L290 TraceCheckUtils]: 106: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,971 INFO L290 TraceCheckUtils]: 107: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,972 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12641#true} {12965#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {12965#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:39:56,972 INFO L290 TraceCheckUtils]: 109: Hoare triple {12965#(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; {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:56,972 INFO L290 TraceCheckUtils]: 110: Hoare triple {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:56,972 INFO L272 TraceCheckUtils]: 111: Hoare triple {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,972 INFO L290 TraceCheckUtils]: 112: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,972 INFO L290 TraceCheckUtils]: 113: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,973 INFO L290 TraceCheckUtils]: 114: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,973 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12641#true} {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:39:56,973 INFO L290 TraceCheckUtils]: 116: Hoare triple {12987#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13009#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:39:56,974 INFO L290 TraceCheckUtils]: 117: Hoare triple {13009#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {13009#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:39:56,974 INFO L272 TraceCheckUtils]: 118: Hoare triple {13009#(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)); {12641#true} is VALID [2022-04-27 14:39:56,974 INFO L290 TraceCheckUtils]: 119: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,974 INFO L290 TraceCheckUtils]: 120: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,974 INFO L290 TraceCheckUtils]: 121: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,974 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12641#true} {13009#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {13009#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:39:56,974 INFO L290 TraceCheckUtils]: 123: Hoare triple {13009#(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; {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:39:56,975 INFO L290 TraceCheckUtils]: 124: Hoare triple {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:39:56,975 INFO L272 TraceCheckUtils]: 125: Hoare triple {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,975 INFO L290 TraceCheckUtils]: 126: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,975 INFO L290 TraceCheckUtils]: 127: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,975 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12641#true} {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:39:56,976 INFO L290 TraceCheckUtils]: 130: Hoare triple {13031#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,976 INFO L290 TraceCheckUtils]: 131: Hoare triple {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,976 INFO L272 TraceCheckUtils]: 132: Hoare triple {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,976 INFO L290 TraceCheckUtils]: 133: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,977 INFO L290 TraceCheckUtils]: 134: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,977 INFO L290 TraceCheckUtils]: 135: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,977 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12641#true} {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:39:56,977 INFO L290 TraceCheckUtils]: 137: Hoare triple {13053#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:39:56,978 INFO L290 TraceCheckUtils]: 138: Hoare triple {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:39:56,978 INFO L272 TraceCheckUtils]: 139: Hoare triple {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12641#true} is VALID [2022-04-27 14:39:56,978 INFO L290 TraceCheckUtils]: 140: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,978 INFO L290 TraceCheckUtils]: 141: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,978 INFO L290 TraceCheckUtils]: 142: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,978 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12641#true} {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:39:56,979 INFO L290 TraceCheckUtils]: 144: Hoare triple {13075#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:39:56,979 INFO L290 TraceCheckUtils]: 145: Hoare triple {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !false; {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:39:56,979 INFO L272 TraceCheckUtils]: 146: Hoare triple {13097#(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)); {12641#true} is VALID [2022-04-27 14:39:56,979 INFO L290 TraceCheckUtils]: 147: Hoare triple {12641#true} ~cond := #in~cond; {12641#true} is VALID [2022-04-27 14:39:56,983 INFO L290 TraceCheckUtils]: 148: Hoare triple {12641#true} assume !(0 == ~cond); {12641#true} is VALID [2022-04-27 14:39:56,983 INFO L290 TraceCheckUtils]: 149: Hoare triple {12641#true} assume true; {12641#true} is VALID [2022-04-27 14:39:56,991 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {12641#true} {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} #54#return; {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-27 14:39:56,992 INFO L290 TraceCheckUtils]: 151: Hoare triple {13097#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {13119#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~k~0 19))} is VALID [2022-04-27 14:39:56,993 INFO L272 TraceCheckUtils]: 152: Hoare triple {13119#(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)); {13123#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:56,993 INFO L290 TraceCheckUtils]: 153: Hoare triple {13123#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13127#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:56,993 INFO L290 TraceCheckUtils]: 154: Hoare triple {13127#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12642#false} is VALID [2022-04-27 14:39:56,993 INFO L290 TraceCheckUtils]: 155: Hoare triple {12642#false} assume !false; {12642#false} is VALID [2022-04-27 14:39:56,994 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:39:56,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:57,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359018276] [2022-04-27 14:39:57,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:57,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723534247] [2022-04-27 14:39:57,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723534247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:57,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:57,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-27 14:39:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713610268] [2022-04-27 14:39:57,260 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:57,261 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:39:57,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:57,261 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:39:57,352 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:39:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 14:39:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 14:39:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:39:57,353 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:40:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:00,631 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 14:40:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:40:00,632 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:40:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:40:00,632 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:40:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:40:00,633 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:40:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:40:00,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-27 14:40:00,755 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:40:00,756 INFO L225 Difference]: With dead ends: 93 [2022-04-27 14:40:00,756 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 14:40:00,756 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:40:00,756 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:40:00,757 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.6s Time] [2022-04-27 14:40:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 14:40:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 14:40:00,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:40:00,809 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:40:00,809 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:40:00,809 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:40:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:00,811 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:40:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:40:00,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:00,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:00,811 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:40:00,811 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:40:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:00,813 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:40:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:40:00,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:00,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:00,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:40:00,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:40:00,813 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:40:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-27 14:40:00,816 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-27 14:40:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:40:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-27 14:40:00,817 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:40:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:40:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-27 14:40:00,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:40:00,818 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:40:00,825 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:40:01,027 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:40:01,028 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:40:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:40:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 20 times [2022-04-27 14:40:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:40:01,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851221279] [2022-04-27 14:40:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:40:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:40:01,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:40:01,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583083593] [2022-04-27 14:40:01,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:40:01,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:40:01,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:40:01,047 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:40:01,048 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:40:01,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:40:01,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:40:01,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-27 14:40:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:01,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:40:03,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {13642#true} call ULTIMATE.init(); {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {13642#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); {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13642#true} {13642#true} #60#return; {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {13642#true} call #t~ret5 := main(); {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {13642#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; {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {13642#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {13642#true} ~cond := #in~cond; {13668#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:40:03,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {13668#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:40:03,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {13672#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:40:03,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13672#(not (= |assume_abort_if_not_#in~cond| 0))} {13642#true} #52#return; {13679#(and (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {13679#(and (<= main_~k~0 20) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:03,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} assume !false; {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:03,379 INFO L272 TraceCheckUtils]: 13: Hoare triple {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~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)); {13642#true} is VALID [2022-04-27 14:40:03,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,379 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13642#true} {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} #54#return; {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:03,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {13683#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 0 main_~c~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; {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} assume !false; {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,381 INFO L272 TraceCheckUtils]: 20: Hoare triple {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,382 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13642#true} {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} #54#return; {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {13705#(and (<= 1 main_~c~0) (<= main_~k~0 20) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:40:03,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:40:03,383 INFO L272 TraceCheckUtils]: 27: Hoare triple {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,384 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13642#true} {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:40:03,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {13727#(and (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} is VALID [2022-04-27 14:40:03,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} assume !false; {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} is VALID [2022-04-27 14:40:03,385 INFO L272 TraceCheckUtils]: 34: Hoare triple {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,385 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13642#true} {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} #54#return; {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} is VALID [2022-04-27 14:40:03,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {13749#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 3) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} is VALID [2022-04-27 14:40:03,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} assume !false; {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} is VALID [2022-04-27 14:40:03,387 INFO L272 TraceCheckUtils]: 41: Hoare triple {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,387 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13642#true} {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} #54#return; {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} is VALID [2022-04-27 14:40:03,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {13771#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 3) (<= 5 main_~c~0))} is VALID [2022-04-27 14:40:03,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 3) (<= 5 main_~c~0))} assume !false; {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 3) (<= 5 main_~c~0))} is VALID [2022-04-27 14:40:03,388 INFO L272 TraceCheckUtils]: 48: Hoare triple {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 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)); {13642#true} is VALID [2022-04-27 14:40:03,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,389 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13642#true} {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 3) (<= 5 main_~c~0))} #54#return; {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 3) (<= 5 main_~c~0))} is VALID [2022-04-27 14:40:03,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {13793#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 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; {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:40:03,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:40:03,390 INFO L272 TraceCheckUtils]: 55: Hoare triple {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,391 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13642#true} {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:40:03,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {13815#(and (= main_~y~0 6) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:40:03,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:40:03,392 INFO L272 TraceCheckUtils]: 62: Hoare triple {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,392 INFO L290 TraceCheckUtils]: 64: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,393 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13642#true} {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:40:03,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {13837#(and (= 7 main_~y~0) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:40:03,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:40:03,394 INFO L272 TraceCheckUtils]: 69: Hoare triple {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,394 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13642#true} {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:40:03,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {13859#(and (<= main_~k~0 20) (= 7 (+ (- 1) main_~y~0)) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,396 INFO L272 TraceCheckUtils]: 76: Hoare triple {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,396 INFO L290 TraceCheckUtils]: 77: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,396 INFO L290 TraceCheckUtils]: 78: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,396 INFO L290 TraceCheckUtils]: 79: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,396 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13642#true} {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,397 INFO L290 TraceCheckUtils]: 81: Hoare triple {13881#(and (<= 9 main_~c~0) (= main_~y~0 9) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !false; {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,397 INFO L272 TraceCheckUtils]: 83: Hoare triple {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,398 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13642#true} {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} #54#return; {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} is VALID [2022-04-27 14:40:03,399 INFO L290 TraceCheckUtils]: 88: Hoare triple {13903#(and (<= 10 main_~c~0) (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:40:03,399 INFO L290 TraceCheckUtils]: 89: Hoare triple {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} assume !false; {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:40:03,399 INFO L272 TraceCheckUtils]: 90: Hoare triple {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 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)); {13642#true} is VALID [2022-04-27 14:40:03,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,399 INFO L290 TraceCheckUtils]: 93: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,399 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13642#true} {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} #54#return; {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:40:03,400 INFO L290 TraceCheckUtils]: 95: Hoare triple {13925#(and (<= 11 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,401 INFO L290 TraceCheckUtils]: 96: Hoare triple {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} assume !false; {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,401 INFO L272 TraceCheckUtils]: 97: Hoare triple {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,401 INFO L290 TraceCheckUtils]: 98: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,401 INFO L290 TraceCheckUtils]: 99: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,401 INFO L290 TraceCheckUtils]: 100: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,401 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13642#true} {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} #54#return; {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,402 INFO L290 TraceCheckUtils]: 102: Hoare triple {13947#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 12 main_~c~0) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,403 INFO L290 TraceCheckUtils]: 103: Hoare triple {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 2) main_~y~0) 11))} assume !false; {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,403 INFO L272 TraceCheckUtils]: 104: Hoare triple {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 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)); {13642#true} is VALID [2022-04-27 14:40:03,403 INFO L290 TraceCheckUtils]: 105: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,403 INFO L290 TraceCheckUtils]: 106: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,403 INFO L290 TraceCheckUtils]: 107: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,403 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13642#true} {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 2) main_~y~0) 11))} #54#return; {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:40:03,404 INFO L290 TraceCheckUtils]: 109: Hoare triple {13969#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 13 main_~c~0) (= (+ (- 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; {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-27 14:40:03,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !false; {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-27 14:40:03,404 INFO L272 TraceCheckUtils]: 111: Hoare triple {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,404 INFO L290 TraceCheckUtils]: 112: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,404 INFO L290 TraceCheckUtils]: 113: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,404 INFO L290 TraceCheckUtils]: 114: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,405 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13642#true} {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} #54#return; {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} is VALID [2022-04-27 14:40:03,406 INFO L290 TraceCheckUtils]: 116: Hoare triple {13991#(and (= (+ main_~y~0 (- 3)) 11) (<= main_~k~0 20) (<= 0 main_~k~0) (<= 14 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-27 14:40:03,406 INFO L290 TraceCheckUtils]: 117: Hoare triple {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !false; {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-27 14:40:03,406 INFO L272 TraceCheckUtils]: 118: Hoare triple {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,407 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13642#true} {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} #54#return; {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} is VALID [2022-04-27 14:40:03,407 INFO L290 TraceCheckUtils]: 123: Hoare triple {14013#(and (<= main_~k~0 20) (= main_~y~0 15) (<= 0 main_~k~0) (<= 15 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} is VALID [2022-04-27 14:40:03,408 INFO L290 TraceCheckUtils]: 124: Hoare triple {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} assume !false; {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} is VALID [2022-04-27 14:40:03,408 INFO L272 TraceCheckUtils]: 125: Hoare triple {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,408 INFO L290 TraceCheckUtils]: 126: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,408 INFO L290 TraceCheckUtils]: 127: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,408 INFO L290 TraceCheckUtils]: 128: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,408 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13642#true} {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} #54#return; {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} is VALID [2022-04-27 14:40:03,409 INFO L290 TraceCheckUtils]: 130: Hoare triple {14035#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= 15 (+ (- 1) main_~y~0)) (<= 16 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} is VALID [2022-04-27 14:40:03,409 INFO L290 TraceCheckUtils]: 131: Hoare triple {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} assume !false; {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} is VALID [2022-04-27 14:40:03,410 INFO L272 TraceCheckUtils]: 132: Hoare triple {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,410 INFO L290 TraceCheckUtils]: 133: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,410 INFO L290 TraceCheckUtils]: 134: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,410 INFO L290 TraceCheckUtils]: 135: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,410 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13642#true} {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} #54#return; {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} is VALID [2022-04-27 14:40:03,411 INFO L290 TraceCheckUtils]: 137: Hoare triple {14057#(and (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ (- 2) main_~y~0) 15) (<= 17 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-27 14:40:03,411 INFO L290 TraceCheckUtils]: 138: Hoare triple {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} assume !false; {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-27 14:40:03,411 INFO L272 TraceCheckUtils]: 139: Hoare triple {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,411 INFO L290 TraceCheckUtils]: 140: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,411 INFO L290 TraceCheckUtils]: 141: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,411 INFO L290 TraceCheckUtils]: 142: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,412 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13642#true} {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} #54#return; {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-27 14:40:03,413 INFO L290 TraceCheckUtils]: 144: Hoare triple {14079#(and (<= 18 main_~c~0) (<= main_~k~0 20) (<= 0 main_~k~0) (= (+ main_~y~0 (- 3)) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-27 14:40:03,413 INFO L290 TraceCheckUtils]: 145: Hoare triple {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} assume !false; {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-27 14:40:03,413 INFO L272 TraceCheckUtils]: 146: Hoare triple {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,413 INFO L290 TraceCheckUtils]: 147: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,413 INFO L290 TraceCheckUtils]: 148: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,413 INFO L290 TraceCheckUtils]: 149: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,413 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13642#true} {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} #54#return; {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} is VALID [2022-04-27 14:40:03,414 INFO L290 TraceCheckUtils]: 151: Hoare triple {14101#(and (<= main_~k~0 20) (<= 0 main_~k~0) (<= 19 main_~c~0) (= (+ main_~y~0 (- 4)) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:40:03,414 INFO L290 TraceCheckUtils]: 152: Hoare triple {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:40:03,414 INFO L272 TraceCheckUtils]: 153: Hoare triple {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:03,414 INFO L290 TraceCheckUtils]: 154: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:03,415 INFO L290 TraceCheckUtils]: 155: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:03,415 INFO L290 TraceCheckUtils]: 156: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:03,415 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {13642#true} {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #54#return; {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:40:03,415 INFO L290 TraceCheckUtils]: 158: Hoare triple {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:40:03,416 INFO L272 TraceCheckUtils]: 159: Hoare triple {14123#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:40:03,416 INFO L290 TraceCheckUtils]: 160: Hoare triple {14148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:03,416 INFO L290 TraceCheckUtils]: 161: Hoare triple {14152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13643#false} is VALID [2022-04-27 14:40:03,416 INFO L290 TraceCheckUtils]: 162: Hoare triple {13643#false} assume !false; {13643#false} is VALID [2022-04-27 14:40:03,417 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:40:03,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:40:05,682 INFO L290 TraceCheckUtils]: 162: Hoare triple {13643#false} assume !false; {13643#false} is VALID [2022-04-27 14:40:05,682 INFO L290 TraceCheckUtils]: 161: Hoare triple {14152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13643#false} is VALID [2022-04-27 14:40:05,682 INFO L290 TraceCheckUtils]: 160: Hoare triple {14148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:05,683 INFO L272 TraceCheckUtils]: 159: Hoare triple {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:40:05,683 INFO L290 TraceCheckUtils]: 158: Hoare triple {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !(~c~0 < ~k~0); {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-27 14:40:05,683 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {13642#true} {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #54#return; {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-27 14:40:05,683 INFO L290 TraceCheckUtils]: 156: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,684 INFO L290 TraceCheckUtils]: 155: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,684 INFO L290 TraceCheckUtils]: 154: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,684 INFO L272 TraceCheckUtils]: 153: Hoare triple {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,684 INFO L290 TraceCheckUtils]: 152: Hoare triple {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} assume !false; {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-27 14:40:05,686 INFO L290 TraceCheckUtils]: 151: Hoare triple {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14168#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-27 14:40:05,686 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13642#true} {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #54#return; {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-27 14:40:05,686 INFO L290 TraceCheckUtils]: 149: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,686 INFO L290 TraceCheckUtils]: 148: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,686 INFO L290 TraceCheckUtils]: 147: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,686 INFO L272 TraceCheckUtils]: 146: Hoare triple {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,687 INFO L290 TraceCheckUtils]: 145: Hoare triple {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !false; {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-27 14:40:05,690 INFO L290 TraceCheckUtils]: 144: Hoare triple {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14193#(or (not (< main_~c~0 main_~k~0)) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-27 14:40:05,690 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13642#true} {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #54#return; {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-27 14:40:05,690 INFO L290 TraceCheckUtils]: 142: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,690 INFO L290 TraceCheckUtils]: 141: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,690 INFO L290 TraceCheckUtils]: 140: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,691 INFO L272 TraceCheckUtils]: 139: Hoare triple {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,691 INFO L290 TraceCheckUtils]: 138: Hoare triple {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !false; {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-27 14:40:05,693 INFO L290 TraceCheckUtils]: 137: Hoare triple {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~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; {14215#(or (<= main_~k~0 (+ main_~c~0 1)) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-27 14:40:05,697 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13642#true} {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} #54#return; {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-27 14:40:05,697 INFO L290 TraceCheckUtils]: 135: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,697 INFO L290 TraceCheckUtils]: 134: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,697 INFO L290 TraceCheckUtils]: 133: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,697 INFO L272 TraceCheckUtils]: 132: Hoare triple {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,697 INFO L290 TraceCheckUtils]: 131: Hoare triple {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} assume !false; {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-27 14:40:05,700 INFO L290 TraceCheckUtils]: 130: Hoare triple {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~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; {14237#(or (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (<= main_~k~0 (+ main_~c~0 2)))} is VALID [2022-04-27 14:40:05,701 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13642#true} {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} #54#return; {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-27 14:40:05,701 INFO L290 TraceCheckUtils]: 128: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,701 INFO L290 TraceCheckUtils]: 127: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,701 INFO L290 TraceCheckUtils]: 126: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,701 INFO L272 TraceCheckUtils]: 125: Hoare triple {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~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)); {13642#true} is VALID [2022-04-27 14:40:05,701 INFO L290 TraceCheckUtils]: 124: Hoare triple {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} assume !false; {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-27 14:40:05,703 INFO L290 TraceCheckUtils]: 123: Hoare triple {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~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; {14259#(or (<= main_~k~0 (+ main_~c~0 3)) (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))))} is VALID [2022-04-27 14:40:05,704 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13642#true} {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} #54#return; {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-27 14:40:05,704 INFO L290 TraceCheckUtils]: 121: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,704 INFO L290 TraceCheckUtils]: 120: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,704 INFO L290 TraceCheckUtils]: 119: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,704 INFO L272 TraceCheckUtils]: 118: Hoare triple {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= 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)); {13642#true} is VALID [2022-04-27 14:40:05,704 INFO L290 TraceCheckUtils]: 117: Hoare triple {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} assume !false; {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-27 14:40:05,706 INFO L290 TraceCheckUtils]: 116: Hoare triple {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) 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; {14281#(or (= (* (+ 5 main_~y~0) main_~k~0) (* (+ 5 main_~y~0) (+ 5 main_~y~0))) (<= main_~k~0 (+ main_~c~0 4)))} is VALID [2022-04-27 14:40:05,706 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13642#true} {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} #54#return; {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-27 14:40:05,706 INFO L290 TraceCheckUtils]: 114: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,706 INFO L290 TraceCheckUtils]: 113: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,706 INFO L290 TraceCheckUtils]: 112: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,707 INFO L272 TraceCheckUtils]: 111: Hoare triple {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,707 INFO L290 TraceCheckUtils]: 110: Hoare triple {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} assume !false; {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-27 14:40:05,709 INFO L290 TraceCheckUtils]: 109: Hoare triple {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ 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; {14303#(or (<= main_~k~0 (+ 5 main_~c~0)) (= (* (+ main_~y~0 6) (+ main_~y~0 6)) (* (+ main_~y~0 6) main_~k~0)))} is VALID [2022-04-27 14:40:05,710 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13642#true} {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} #54#return; {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-27 14:40:05,710 INFO L290 TraceCheckUtils]: 107: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,710 INFO L290 TraceCheckUtils]: 106: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,710 INFO L290 TraceCheckUtils]: 105: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,710 INFO L272 TraceCheckUtils]: 104: Hoare triple {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= 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)); {13642#true} is VALID [2022-04-27 14:40:05,710 INFO L290 TraceCheckUtils]: 103: Hoare triple {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} assume !false; {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-27 14:40:05,712 INFO L290 TraceCheckUtils]: 102: Hoare triple {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14325#(or (= (* (+ 7 main_~y~0) main_~k~0) (* (+ 7 main_~y~0) (+ 7 main_~y~0))) (<= main_~k~0 (+ main_~c~0 6)))} is VALID [2022-04-27 14:40:05,712 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13642#true} {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} #54#return; {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-27 14:40:05,712 INFO L290 TraceCheckUtils]: 100: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,712 INFO L290 TraceCheckUtils]: 99: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,712 INFO L272 TraceCheckUtils]: 97: Hoare triple {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} assume !false; {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-27 14:40:05,716 INFO L290 TraceCheckUtils]: 95: Hoare triple {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~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; {14347#(or (= (* (+ main_~y~0 8) (+ main_~y~0 8)) (* (+ main_~y~0 8) main_~k~0)) (<= main_~k~0 (+ 7 main_~c~0)))} is VALID [2022-04-27 14:40:05,716 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13642#true} {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} #54#return; {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-27 14:40:05,716 INFO L290 TraceCheckUtils]: 93: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,716 INFO L290 TraceCheckUtils]: 92: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,716 INFO L272 TraceCheckUtils]: 90: Hoare triple {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~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)); {13642#true} is VALID [2022-04-27 14:40:05,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} assume !false; {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-27 14:40:05,720 INFO L290 TraceCheckUtils]: 88: Hoare triple {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= 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; {14369#(or (= (* main_~k~0 (+ main_~y~0 9)) (* (+ main_~y~0 9) (+ main_~y~0 9))) (<= main_~k~0 (+ main_~c~0 8)))} is VALID [2022-04-27 14:40:05,720 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13642#true} {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} #54#return; {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-27 14:40:05,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,720 INFO L272 TraceCheckUtils]: 83: Hoare triple {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= 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)); {13642#true} is VALID [2022-04-27 14:40:05,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} assume !false; {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-27 14:40:05,723 INFO L290 TraceCheckUtils]: 81: Hoare triple {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14391#(or (= (* (+ main_~y~0 10) (+ main_~y~0 10)) (* main_~k~0 (+ main_~y~0 10))) (<= main_~k~0 (+ main_~c~0 9)))} is VALID [2022-04-27 14:40:05,724 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13642#true} {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} #54#return; {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} is VALID [2022-04-27 14:40:05,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,724 INFO L272 TraceCheckUtils]: 76: Hoare triple {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* 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)); {13642#true} is VALID [2022-04-27 14:40:05,724 INFO L290 TraceCheckUtils]: 75: Hoare triple {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} assume !false; {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} is VALID [2022-04-27 14:40:05,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ 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; {14413#(or (<= main_~k~0 (+ main_~c~0 10)) (= (* (+ main_~y~0 11) (+ main_~y~0 11)) (* main_~k~0 (+ main_~y~0 11))))} is VALID [2022-04-27 14:40:05,727 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13642#true} {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ main_~c~0 11)))} #54#return; {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ main_~c~0 11)))} is VALID [2022-04-27 14:40:05,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,728 INFO L272 TraceCheckUtils]: 69: Hoare triple {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ 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)); {13642#true} is VALID [2022-04-27 14:40:05,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ main_~c~0 11)))} assume !false; {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ main_~c~0 11)))} is VALID [2022-04-27 14:40:05,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ 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; {14435#(or (= (* (+ main_~y~0 12) main_~k~0) (* (+ main_~y~0 12) (+ main_~y~0 12))) (<= main_~k~0 (+ main_~c~0 11)))} is VALID [2022-04-27 14:40:05,731 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13642#true} {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ main_~c~0 12)))} #54#return; {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ main_~c~0 12)))} is VALID [2022-04-27 14:40:05,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,731 INFO L272 TraceCheckUtils]: 62: Hoare triple {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ 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)); {13642#true} is VALID [2022-04-27 14:40:05,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ main_~c~0 12)))} assume !false; {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ main_~c~0 12)))} is VALID [2022-04-27 14:40:05,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ 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; {14457#(or (= (* (+ main_~y~0 13) (+ main_~y~0 13)) (* main_~k~0 (+ main_~y~0 13))) (<= main_~k~0 (+ main_~c~0 12)))} is VALID [2022-04-27 14:40:05,735 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13642#true} {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ main_~c~0 13)))} #54#return; {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ main_~c~0 13)))} is VALID [2022-04-27 14:40:05,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,735 INFO L272 TraceCheckUtils]: 55: Hoare triple {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ 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)); {13642#true} is VALID [2022-04-27 14:40:05,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ main_~c~0 13)))} assume !false; {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ main_~c~0 13)))} is VALID [2022-04-27 14:40:05,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) 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; {14479#(or (= (* (+ main_~y~0 14) main_~k~0) (* (+ main_~y~0 14) (+ main_~y~0 14))) (<= main_~k~0 (+ main_~c~0 13)))} is VALID [2022-04-27 14:40:05,737 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13642#true} {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) main_~k~0)))} #54#return; {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) main_~k~0)))} is VALID [2022-04-27 14:40:05,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,738 INFO L272 TraceCheckUtils]: 48: Hoare triple {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) 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)); {13642#true} is VALID [2022-04-27 14:40:05,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) main_~k~0)))} assume !false; {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) main_~k~0)))} is VALID [2022-04-27 14:40:05,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ 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; {14501#(or (<= main_~k~0 (+ main_~c~0 14)) (= (* (+ main_~y~0 15) (+ main_~y~0 15)) (* (+ main_~y~0 15) main_~k~0)))} is VALID [2022-04-27 14:40:05,741 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13642#true} {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ main_~c~0 15)))} #54#return; {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ main_~c~0 15)))} is VALID [2022-04-27 14:40:05,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,741 INFO L272 TraceCheckUtils]: 41: Hoare triple {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= 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)); {13642#true} is VALID [2022-04-27 14:40:05,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ main_~c~0 15)))} assume !false; {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ main_~c~0 15)))} is VALID [2022-04-27 14:40:05,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~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; {14523#(or (= (* main_~k~0 (+ main_~y~0 16)) (* (+ main_~y~0 16) (+ main_~y~0 16))) (<= main_~k~0 (+ main_~c~0 15)))} is VALID [2022-04-27 14:40:05,745 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13642#true} {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~0 17) (+ main_~y~0 17))))} #54#return; {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~0 17) (+ main_~y~0 17))))} is VALID [2022-04-27 14:40:05,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,745 INFO L272 TraceCheckUtils]: 34: Hoare triple {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~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)); {13642#true} is VALID [2022-04-27 14:40:05,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~0 17) (+ main_~y~0 17))))} assume !false; {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~0 17) (+ main_~y~0 17))))} is VALID [2022-04-27 14:40:05,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~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; {14545#(or (<= main_~k~0 (+ main_~c~0 16)) (= (* (+ main_~y~0 17) main_~k~0) (* (+ main_~y~0 17) (+ main_~y~0 17))))} is VALID [2022-04-27 14:40:05,748 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13642#true} {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~0 18) (+ main_~y~0 18))))} #54#return; {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~0 18) (+ main_~y~0 18))))} is VALID [2022-04-27 14:40:05,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,748 INFO L272 TraceCheckUtils]: 27: Hoare triple {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~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)); {13642#true} is VALID [2022-04-27 14:40:05,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~0 18) (+ main_~y~0 18))))} assume !false; {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~0 18) (+ main_~y~0 18))))} is VALID [2022-04-27 14:40:05,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14567#(or (<= main_~k~0 (+ main_~c~0 17)) (= (* (+ main_~y~0 18) main_~k~0) (* (+ main_~y~0 18) (+ main_~y~0 18))))} is VALID [2022-04-27 14:40:05,753 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13642#true} {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} #54#return; {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} is VALID [2022-04-27 14:40:05,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,753 INFO L272 TraceCheckUtils]: 20: Hoare triple {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} assume !false; {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} is VALID [2022-04-27 14:40:05,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= 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; {14589#(or (= (* (+ 19 main_~y~0) (+ 19 main_~y~0)) (* (+ 19 main_~y~0) main_~k~0)) (<= main_~k~0 (+ main_~c~0 18)))} is VALID [2022-04-27 14:40:05,758 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13642#true} {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= main_~k~0 (+ 19 main_~c~0)))} #54#return; {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= main_~k~0 (+ 19 main_~c~0)))} is VALID [2022-04-27 14:40:05,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {13642#true} assume !(0 == ~cond); {13642#true} is VALID [2022-04-27 14:40:05,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {13642#true} ~cond := #in~cond; {13642#true} is VALID [2022-04-27 14:40:05,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= 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)); {13642#true} is VALID [2022-04-27 14:40:05,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= main_~k~0 (+ 19 main_~c~0)))} assume !false; {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= main_~k~0 (+ 19 main_~c~0)))} is VALID [2022-04-27 14:40:05,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {14633#(or (= (* main_~k~0 20) 400) (<= main_~k~0 19))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14611#(or (= (* (+ main_~y~0 20) (+ main_~y~0 20)) (* main_~k~0 (+ main_~y~0 20))) (<= main_~k~0 (+ 19 main_~c~0)))} is VALID [2022-04-27 14:40:05,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13672#(not (= |assume_abort_if_not_#in~cond| 0))} {13642#true} #52#return; {14633#(or (= (* main_~k~0 20) 400) (<= main_~k~0 19))} is VALID [2022-04-27 14:40:05,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {13672#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:40:05,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {14646#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {13672#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:40:05,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {13642#true} ~cond := #in~cond; {14646#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:40:05,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {13642#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {13642#true} is VALID [2022-04-27 14:40:05,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {13642#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; {13642#true} is VALID [2022-04-27 14:40:05,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {13642#true} call #t~ret5 := main(); {13642#true} is VALID [2022-04-27 14:40:05,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13642#true} {13642#true} #60#return; {13642#true} is VALID [2022-04-27 14:40:05,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {13642#true} assume true; {13642#true} is VALID [2022-04-27 14:40:05,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {13642#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); {13642#true} is VALID [2022-04-27 14:40:05,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {13642#true} call ULTIMATE.init(); {13642#true} is VALID [2022-04-27 14:40:05,761 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:40:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:40:05,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851221279] [2022-04-27 14:40:05,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:40:05,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583083593] [2022-04-27 14:40:05,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583083593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:40:05,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:40:05,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2022-04-27 14:40:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10020773] [2022-04-27 14:40:05,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:40:05,763 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) Word has length 163 [2022-04-27 14:40:05,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:40:05,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) [2022-04-27 14:40:05,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-27 14:40:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:40:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-27 14:40:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=2194, Unknown=0, NotChecked=0, Total=2550 [2022-04-27 14:40:05,979 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) [2022-04-27 14:40:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:11,488 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-27 14:40:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 14:40:11,488 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) Word has length 163 [2022-04-27 14:40:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:40:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) [2022-04-27 14:40:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-27 14:40:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) [2022-04-27 14:40:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-27 14:40:11,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-27 14:40:11,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:11,611 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:40:11,611 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:40:11,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=391, Invalid=2471, Unknown=0, NotChecked=0, Total=2862 [2022-04-27 14:40:11,613 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 69 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:40:11,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 975 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 14:40:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:40:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:40:11,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:40:11,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:40:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:40:11,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:40:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:11,613 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:40:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:40:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:11,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:40:11,614 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:40:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:11,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:40:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:40:11,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:11,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:11,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:40:11,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:40:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:40:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:40:11,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2022-04-27 14:40:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:40:11,614 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:40:11,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 48 states have internal predecessors, (100), 43 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 45 states have call predecessors, (45), 43 states have call successors, (45) [2022-04-27 14:40:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:40:11,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:11,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:40:11,623 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:40:11,821 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:40:11,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-27 14:40:13,282 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (not (< main_~c~0 main_~k~0)) (< 19 main_~k~0) (= main_~y~0 20) .cse1) (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (< 18 main_~k~0) (<= 19 main_~c~0) (<= main_~c~0 19) (= 19 main_~y~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-27 14:40:13,282 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:40:13,282 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 20)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (not (< main_~c~0 main_~k~0)) (< 19 main_~k~0) (= main_~y~0 20) .cse1) (and .cse0 (= main_~c~0 16) (= main_~y~0 16) .cse1 (< 15 main_~k~0)) (and (= 7 main_~y~0) (= 7 main_~c~0) .cse0 .cse1 (< 6 main_~k~0)) (and (= main_~y~0 9) .cse0 (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and (< 7 main_~k~0) (= main_~y~0 8) .cse0 (= main_~c~0 8) .cse1) (and (= main_~c~0 17) .cse0 .cse1 (< 16 main_~k~0) (= main_~y~0 17)) (and (= main_~y~0 12) .cse0 (= main_~c~0 12) (< 11 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (< 18 main_~k~0) (<= 19 main_~c~0) (<= main_~c~0 19) (= 19 main_~y~0) .cse1) (and (< 17 main_~k~0) .cse0 (= main_~c~0 18) .cse1 (= main_~y~0 18)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and .cse0 (= main_~y~0 10) (< 9 main_~k~0) (= main_~c~0 10) .cse1) (and (= main_~c~0 15) .cse0 (= main_~y~0 15) (< 14 main_~k~0) .cse1) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (= main_~c~0 2) .cse1) (and (< 12 main_~k~0) .cse0 (= main_~c~0 13) (= main_~y~0 13) .cse1) (and (< 10 main_~k~0) .cse0 (= main_~c~0 11) (= main_~y~0 11) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and (= main_~y~0 14) .cse0 (< 13 main_~k~0) (= main_~c~0 14) .cse1))) [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= main_~k~0 20) (not (< main_~c~0 main_~k~0)) (< 19 main_~k~0) (= main_~y~0 20) .cse0) (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15) (<= main_~k~0 15) .cse0) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (< 12 main_~k~0) (<= main_~c~0 13) (<= main_~k~0 13) (= main_~y~0 13) .cse0) (and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0) .cse0 (<= main_~c~0 6)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (= main_~y~0 14) (< 13 main_~k~0) .cse0 (<= main_~k~0 14) (<= main_~c~0 14)) (and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0) .cse0 (<= main_~k~0 12)) (and (<= main_~k~0 10) (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse0) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 7 main_~y~0) .cse0 (< 6 main_~k~0)) (and (< 17 main_~k~0) (<= main_~c~0 18) (<= main_~k~0 18) .cse0 (= main_~y~0 18)) (and (<= main_~k~0 16) (= main_~y~0 16) .cse0 (< 15 main_~k~0) (<= main_~c~0 16)) (and (< 18 main_~k~0) (<= main_~c~0 19) (<= main_~k~0 19) (= 19 main_~y~0) .cse0) (and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11) .cse0) (and (<= main_~c~0 17) (<= main_~k~0 17) .cse0 (< 16 main_~k~0) (= main_~y~0 17)) (and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= main_~k~0 8) .cse0))) [2022-04-27 14:40:13,283 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:40:13,283 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:40:13,283 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:40:13,285 INFO L356 BasicCegarLoop]: Path program histogram: [20, 1, 1, 1] [2022-04-27 14:40:13,287 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:40:13,288 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:40:13,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:40:13,289 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:40:13,306 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:40:13,306 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:40:13,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:40:13 BoogieIcfgContainer [2022-04-27 14:40:13,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:40:13,326 INFO L158 Benchmark]: Toolchain (without parser) took 147668.92ms. Allocated memory was 195.0MB in the beginning and 282.1MB in the end (delta: 87.0MB). Free memory was 142.2MB in the beginning and 110.3MB in the end (delta: 31.9MB). Peak memory consumption was 141.4MB. Max. memory is 8.0GB. [2022-04-27 14:40:13,326 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 195.0MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:40:13,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.37ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 168.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 14:40:13,326 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 167.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:40:13,326 INFO L158 Benchmark]: RCFGBuilder took 206.85ms. Allocated memory is still 195.0MB. Free memory was 167.5MB in the beginning and 156.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:40:13,327 INFO L158 Benchmark]: TraceAbstraction took 147283.45ms. Allocated memory was 195.0MB in the beginning and 282.1MB in the end (delta: 87.0MB). Free memory was 156.0MB in the beginning and 110.3MB in the end (delta: 45.7MB). Peak memory consumption was 155.0MB. Max. memory is 8.0GB. [2022-04-27 14:40:13,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 195.0MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 153.37ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 168.9MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 167.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.85ms. Allocated memory is still 195.0MB. Free memory was 167.5MB in the beginning and 156.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 147283.45ms. Allocated memory was 195.0MB in the beginning and 282.1MB in the end (delta: 87.0MB). Free memory was 156.0MB in the beginning and 110.3MB in the end (delta: 45.7MB). Peak memory consumption was 155.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 147.2s, OverallIterations: 23, TraceHistogramMax: 22, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 9977 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8880 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13462 IncrementalHoareTripleChecker+Invalid, 13578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 1097 mSDtfsCounter, 13462 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2561 GetRequests, 2081 SyntacticMatches, 22 SemanticMatches, 458 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=22, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 59 PreInvPairs, 124 NumberOfFragments, 2035 HoareAnnotationTreeSize, 59 FomulaSimplifications, 1258 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 18.1s SatisfiabilityAnalysisTime, 86.2s InterpolantComputationTime, 1988 NumberOfCodeBlocks, 1979 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2150 ConstructedInterpolants, 0 QuantifiedInterpolants, 9934 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5190 ConjunctsInSsa, 1026 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 7504/12760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((k <= 20 && !(c < k)) && 19 < k) && y == 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) || ((((k <= 20 && c == 16) && y == 16) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 15 < k)) || ((((7 == y && 7 == c) && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((y == 9 && k <= 20) && c == 9) && 8 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1)) || ((((7 < k && y == 8) && k <= 20) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((c == 17 && k <= 20) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 16 < k) && y == 17)) || ((((y == 12 && k <= 20) && c == 12) && 11 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((k <= 20 && 18 < k) && 19 <= c) && c <= 19) && 19 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((17 < k && k <= 20) && c == 18) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && y == 18)) || ((((k <= 20 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((k <= 20 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || ((((k <= 20 && y == 10) && 9 < k) && c == 10) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((c == 15 && k <= 20) && y == 15) && 14 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 20 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && 1 < k) && k <= 20) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((12 < k && k <= 20) && c == 13) && y == 13) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((10 < k && k <= 20) && c == 11) && y == 11) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 6 && k <= 20) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 14 && k <= 20) && 13 < k) && c == 14) && y * y * y * y + y * y + y * y * y * 2 == x * 4) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:40:13,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...