/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:24:31,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:24:31,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:24:31,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:24:31,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:24:31,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:24:31,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:24:31,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:24:31,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:24:31,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:24:31,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:24:31,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:24:31,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:24:31,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:24:31,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:24:31,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:24:31,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:24:31,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:24:31,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:24:31,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:24:31,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:24:31,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:24:31,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:24:31,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:24:31,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:24:31,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:24:31,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:24:31,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:24:31,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:24:31,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:24:31,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:24:31,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:24:31,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:24:31,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:24:31,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:24:31,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:24:31,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:24:31,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:24:31,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:24:31,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:24:31,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:24:31,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:24:31,645 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-07 15:24:31,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:24:31,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:24:31,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:24:31,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:24:31,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:24:31,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:24:31,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:24:31,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:24:31,670 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:24:31,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:24:31,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:24:31,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:24:31,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:24:31,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:24:31,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:24:31,673 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-07 15:24:31,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:24:31,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:24:31,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:24:31,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:24:31,881 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:24:31,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-07 15:24:31,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4ead559/6e0e449be42d4da8b9e0c7bb81135d24/FLAG1eec6cac0 [2022-04-07 15:24:32,295 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:24:32,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-07 15:24:32,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4ead559/6e0e449be42d4da8b9e0c7bb81135d24/FLAG1eec6cac0 [2022-04-07 15:24:32,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4ead559/6e0e449be42d4da8b9e0c7bb81135d24 [2022-04-07 15:24:32,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:24:32,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:24:32,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:24:32,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:24:32,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:24:32,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,323 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 07.04 03:24:32, skipping insertion in model container [2022-04-07 15:24:32,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:24:32,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:24:32,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-07 15:24:32,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:24:32,478 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:24:32,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-07 15:24:32,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:24:32,496 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:24:32,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32 WrapperNode [2022-04-07 15:24:32,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:24:32,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:24:32,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:24:32,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:24:32,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:24:32,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:24:32,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:24:32,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:24:32,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (1/1) ... [2022-04-07 15:24:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:24:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:32,545 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-07 15:24:32,563 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-07 15:24:32,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:24:32,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:24:32,580 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:24:32,580 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:24:32,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:24:32,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:24:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:24:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:24:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:24:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:24:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:24:32,619 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:24:32,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:24:32,708 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:24:32,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:24:32,712 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:24:32,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:24:32 BoogieIcfgContainer [2022-04-07 15:24:32,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:24:32,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:24:32,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:24:32,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:24:32,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:24:32" (1/3) ... [2022-04-07 15:24:32,716 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 07.04 03:24:32, skipping insertion in model container [2022-04-07 15:24:32,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:24:32" (2/3) ... [2022-04-07 15:24:32,717 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 07.04 03:24:32, skipping insertion in model container [2022-04-07 15:24:32,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:24:32" (3/3) ... [2022-04-07 15:24:32,717 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound50.c [2022-04-07 15:24:32,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:24:32,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:24:32,746 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:24:32,750 INFO L340 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 [2022-04-07 15:24:32,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:24:32,762 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-07 15:24:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 15:24:32,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:32,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:24:32,765 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-07 15:24:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041035459] [2022-04-07 15:24:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:24:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:32,945 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-07 15:24:32,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-07 15:24:32,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-07 15:24:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:24:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:32,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-07 15:24:32,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-07 15:24:32,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-07 15:24:32,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-07 15:24:32,958 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-07 15:24:32,958 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-07 15:24:32,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-07 15:24:32,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-07 15:24:32,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-07 15:24:32,959 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-07 15:24:32,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31#true} is VALID [2022-04-07 15:24:32,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-07 15:24:32,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-07 15:24:32,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-07 15:24:32,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-07 15:24:32,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-07 15:24:32,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-07 15:24:32,961 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-07 15:24:32,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-07 15:24:32,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-07 15:24:32,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-07 15:24:32,961 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-07 15:24:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041035459] [2022-04-07 15:24:32,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041035459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:24:32,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:24:32,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:24:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265632887] [2022-04-07 15:24:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:24:32,970 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-07 15:24:32,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:32,973 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-07 15:24:33,002 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-07 15:24:33,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:24:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:24:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:24:33,024 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-07 15:24:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,138 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-07 15:24:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:24:33,138 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-07 15:24:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:33,139 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-07 15:24:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-07 15:24:33,149 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-07 15:24:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-07 15:24:33,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-07 15:24:33,232 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-07 15:24:33,240 INFO L225 Difference]: With dead ends: 47 [2022-04-07 15:24:33,241 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 15:24:33,243 INFO L912 BasicCegarLoop]: 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-07 15:24:33,246 INFO L913 BasicCegarLoop]: 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-07 15:24:33,247 INFO L914 BasicCegarLoop]: 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-07 15:24:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 15:24:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-07 15:24:33,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:33,266 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-07 15:24:33,266 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-07 15:24:33,267 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-07 15:24:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,269 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 15:24:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 15:24:33,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:33,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:33,270 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-07 15:24:33,271 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-07 15:24:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,273 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 15:24:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 15:24:33,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:33,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:33,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:33,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:33,274 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-07 15:24:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-07 15:24:33,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-07 15:24:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:33,276 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-07 15:24:33,277 INFO L479 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-07 15:24:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 15:24:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 15:24:33,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:33,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:24:33,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:24:33,278 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-07 15:24:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561293234] [2022-04-07 15:24:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:33,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782232974] [2022-04-07 15:24:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:33,295 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-07 15:24:33,313 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-07 15:24:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:33,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:24:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:33,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:33,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-07 15:24:33,461 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-07 15:24:33,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-07 15:24:33,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-07 15:24:33,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-07 15:24:33,461 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-07 15:24:33,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {186#true} is VALID [2022-04-07 15:24:33,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-07 15:24:33,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-07 15:24:33,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-07 15:24:33,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-07 15:24:33,463 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-07 15:24:33,463 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-07 15:24:33,464 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-07 15:24:33,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:33,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-07 15:24:33,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-07 15:24:33,465 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-07 15:24:33,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:24:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561293234] [2022-04-07 15:24:33,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782232974] [2022-04-07 15:24:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782232974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:24:33,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:24:33,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:24:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876309315] [2022-04-07 15:24:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:24:33,468 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-07 15:24:33,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:33,468 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-07 15:24:33,480 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-07 15:24:33,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:24:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:24:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:24:33,481 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-07 15:24:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,861 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 15:24:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:24:33,861 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-07 15:24:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:33,862 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-07 15:24:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-07 15:24:33,864 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-07 15:24:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-07 15:24:33,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-07 15:24:33,897 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-07 15:24:33,898 INFO L225 Difference]: With dead ends: 34 [2022-04-07 15:24:33,898 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 15:24:33,899 INFO L912 BasicCegarLoop]: 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-07 15:24:33,899 INFO L913 BasicCegarLoop]: 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-07 15:24:33,900 INFO L914 BasicCegarLoop]: 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-07 15:24:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 15:24:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-07 15:24:33,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:33,905 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-07 15:24:33,906 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-07 15:24:33,906 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-07 15:24:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,908 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-07 15:24:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-07 15:24:33,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:33,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:33,908 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-07 15:24:33,909 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-07 15:24:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:33,910 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-07 15:24:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-07 15:24:33,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:33,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:33,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:33,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:33,911 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-07 15:24:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-07 15:24:33,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-07 15:24:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:33,913 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-07 15:24:33,913 INFO L479 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-07 15:24:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-07 15:24:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 15:24:33,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:33,914 INFO L499 BasicCegarLoop]: 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-07 15:24:33,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 15:24:34,130 WARN L460 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-07 15:24:34,130 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-07 15:24:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:34,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086267549] [2022-04-07 15:24:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:34,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275047897] [2022-04-07 15:24:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:34,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:34,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:34,146 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-07 15:24:34,159 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-07 15:24:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:34,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 15:24:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:34,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:34,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-07 15:24:34,334 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-07 15:24:34,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-07 15:24:34,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-07 15:24:34,335 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-07 15:24:34,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {397#true} is VALID [2022-04-07 15:24:34,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-07 15:24:34,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-07 15:24:34,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-07 15:24:34,336 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-07 15:24:34,336 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-07 15:24:34,336 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-07 15:24:34,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-07 15:24:34,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-07 15:24:34,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,337 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-07 15:24:34,338 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-07 15:24:34,338 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-07 15:24:34,339 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-07 15:24:34,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:34,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-07 15:24:34,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-07 15:24:34,340 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-07 15:24:34,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:34,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-07 15:24:34,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-07 15:24:34,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:34,462 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-07 15:24:34,463 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-07 15:24:34,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-07 15:24:34,713 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-07 15:24:34,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-07 15:24:34,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-07 15:24:34,713 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-07 15:24:34,714 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-07 15:24:34,714 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-07 15:24:34,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-07 15:24:34,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-07 15:24:34,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-07 15:24:34,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {397#true} is VALID [2022-04-07 15:24:34,715 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-07 15:24:34,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-07 15:24:34,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-07 15:24:34,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-07 15:24:34,716 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-07 15:24:34,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-07 15:24:34,716 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-07 15:24:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:34,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086267549] [2022-04-07 15:24:34,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:34,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275047897] [2022-04-07 15:24:34,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275047897] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:34,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:34,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 15:24:34,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859855360] [2022-04-07 15:24:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:24:34,717 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-07 15:24:34,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:34,718 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-07 15:24:35,184 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-07 15:24:35,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:24:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:24:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 15:24:35,185 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-07 15:24:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:35,270 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-07 15:24:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:24:35,271 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-07 15:24:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:35,271 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-07 15:24:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 15:24:35,272 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-07 15:24:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 15:24:35,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-07 15:24:35,743 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-07 15:24:35,744 INFO L225 Difference]: With dead ends: 36 [2022-04-07 15:24:35,745 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 15:24:35,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:24:35,746 INFO L913 BasicCegarLoop]: 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-07 15:24:35,746 INFO L914 BasicCegarLoop]: 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-07 15:24:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 15:24:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-07 15:24:35,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:35,751 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-07 15:24:35,751 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-07 15:24:35,751 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-07 15:24:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:35,752 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-07 15:24:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-07 15:24:35,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:35,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:35,753 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-07 15:24:35,753 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-07 15:24:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:35,754 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-07 15:24:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-07 15:24:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:35,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:35,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:35,755 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-07 15:24:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-07 15:24:35,756 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-07 15:24:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:35,756 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-07 15:24:35,756 INFO L479 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-07 15:24:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-07 15:24:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 15:24:35,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:35,757 INFO L499 BasicCegarLoop]: 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-07 15:24:35,773 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-07 15:24:35,971 WARN L460 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-07 15:24:35,971 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-07 15:24:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502708534] [2022-04-07 15:24:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:35,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:35,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352323148] [2022-04-07 15:24:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:35,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:35,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:35,985 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-07 15:24:35,989 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-07 15:24:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:36,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 15:24:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:36,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:36,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-07 15:24:36,258 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-07 15:24:36,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-07 15:24:36,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-07 15:24:36,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-07 15:24:36,259 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-07 15:24:36,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {707#true} is VALID [2022-04-07 15:24:36,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-07 15:24:36,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-07 15:24:36,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-07 15:24:36,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-07 15:24:36,260 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-07 15:24:36,260 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-07 15:24:36,260 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-07 15:24:36,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-07 15:24:36,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-07 15:24:36,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-07 15:24:36,261 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-07 15:24:36,262 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-07 15:24:36,262 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-07 15:24:36,262 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-07 15:24:36,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-07 15:24:36,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-07 15:24:36,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-07 15:24:36,263 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-07 15:24:36,264 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-07 15:24:36,264 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-07 15:24:36,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:36,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-07 15:24:36,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-07 15:24:36,265 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-07 15:24:36,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502708534] [2022-04-07 15:24:36,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352323148] [2022-04-07 15:24:36,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352323148] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:36,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:36,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 15:24:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237594358] [2022-04-07 15:24:36,503 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:36,504 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-07 15:24:36,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:36,504 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-07 15:24:36,522 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-07 15:24:36,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 15:24:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 15:24:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:24:36,523 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-07 15:24:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:36,680 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-07 15:24:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 15:24:36,681 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-07 15:24:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:36,681 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-07 15:24:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 15:24:36,682 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-07 15:24:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 15:24:36,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-07 15:24:36,708 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-07 15:24:36,709 INFO L225 Difference]: With dead ends: 39 [2022-04-07 15:24:36,710 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 15:24:36,710 INFO L912 BasicCegarLoop]: 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-07 15:24:36,710 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:24:36,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:24:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 15:24:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 15:24:36,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:36,717 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-07 15:24:36,718 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-07 15:24:36,718 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-07 15:24:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:36,719 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-07 15:24:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-07 15:24:36,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:36,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:36,720 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-07 15:24:36,720 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-07 15:24:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:36,721 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-07 15:24:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-07 15:24:36,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:36,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:36,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:36,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:36,722 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-07 15:24:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-07 15:24:36,723 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-07 15:24:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:36,723 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-07 15:24:36,723 INFO L479 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-07 15:24:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-07 15:24:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:24:36,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:36,724 INFO L499 BasicCegarLoop]: 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-07 15:24:36,741 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-07 15:24:36,940 WARN L460 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-07 15:24:36,940 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-07 15:24:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:36,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419490504] [2022-04-07 15:24:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:36,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:36,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998371190] [2022-04-07 15:24:36,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:24:36,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:36,982 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-07 15:24:37,016 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-07 15:24:37,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:24:37,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:37,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 15:24:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:37,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:37,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-07 15:24:37,301 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-07 15:24:37,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-07 15:24:37,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-07 15:24:37,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-07 15:24:37,301 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-07 15:24:37,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1024#true} is VALID [2022-04-07 15:24:37,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-07 15:24:37,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-07 15:24:37,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-07 15:24:37,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-07 15:24:37,302 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-07 15:24:37,302 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-07 15:24:37,303 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-07 15:24:37,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-07 15:24:37,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-07 15:24:37,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-07 15:24:37,303 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-07 15:24:37,304 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-07 15:24:37,304 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-07 15:24:37,304 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-07 15:24:37,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-07 15:24:37,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-07 15:24:37,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-07 15:24:37,305 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-07 15:24:37,306 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-07 15:24:37,306 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-07 15:24:37,306 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-07 15:24:37,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-07 15:24:37,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-07 15:24:37,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-07 15:24:37,307 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-07 15:24:37,307 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-07 15:24:37,308 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-07 15:24:37,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:37,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-07 15:24:37,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-07 15:24:37,309 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-07 15:24:37,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419490504] [2022-04-07 15:24:37,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998371190] [2022-04-07 15:24:37,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998371190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:37,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:37,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 15:24:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730177168] [2022-04-07 15:24:37,576 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:37,577 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-07 15:24:37,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:37,577 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-07 15:24:37,599 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-07 15:24:37,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 15:24:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 15:24:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-07 15:24:37,600 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-07 15:24:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:37,800 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-07 15:24:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 15:24:37,800 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-07 15:24:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:37,801 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-07 15:24:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-07 15:24:37,802 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-07 15:24:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-07 15:24:37,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-07 15:24:37,828 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-07 15:24:37,829 INFO L225 Difference]: With dead ends: 42 [2022-04-07 15:24:37,829 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 15:24:37,829 INFO L912 BasicCegarLoop]: 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-07 15:24:37,830 INFO L913 BasicCegarLoop]: 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-07 15:24:37,830 INFO L914 BasicCegarLoop]: 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-07 15:24:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 15:24:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-07 15:24:37,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:37,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:24:37,837 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:24:37,838 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-07 15:24:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:37,839 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-07 15:24:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-07 15:24:37,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:37,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:37,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:24:37,840 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-07 15:24:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:37,841 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-07 15:24:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-07 15:24:37,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:37,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:37,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:37,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:24:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-07 15:24:37,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-07 15:24:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:37,853 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-07 15:24:37,853 INFO L479 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-07 15:24:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-07 15:24:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 15:24:37,853 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:37,853 INFO L499 BasicCegarLoop]: 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-07 15:24:37,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 15:24:38,055 WARN L460 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-07 15:24:38,056 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:38,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-07 15:24:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:38,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87531126] [2022-04-07 15:24:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:38,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268019632] [2022-04-07 15:24:38,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:24:38,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:38,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:38,108 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-07 15:24:38,109 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-07 15:24:38,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 15:24:38,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:38,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 15:24:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:38,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:38,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-07 15:24:38,508 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-07 15:24:38,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-07 15:24:38,508 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-07 15:24:38,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-07 15:24:38,510 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-07 15:24:38,510 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-07 15:24:38,510 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-07 15:24:38,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-07 15:24:38,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-07 15:24:38,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,511 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-07 15:24:38,511 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-07 15:24:38,512 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-07 15:24:38,512 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-07 15:24:38,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-07 15:24:38,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-07 15:24:38,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,513 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-07 15:24:38,513 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-07 15:24:38,513 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-07 15:24:38,513 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-07 15:24:38,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-07 15:24:38,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-07 15:24:38,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,516 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-07 15:24:38,516 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-07 15:24:38,517 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-07 15:24:38,517 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-07 15:24:38,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-07 15:24:38,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-07 15:24:38,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-07 15:24:38,518 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-07 15:24:38,518 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-07 15:24:38,519 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-07 15:24:38,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:38,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-07 15:24:38,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-07 15:24:38,520 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-07 15:24:38,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:38,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87531126] [2022-04-07 15:24:38,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:38,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268019632] [2022-04-07 15:24:38,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268019632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:38,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:38,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 15:24:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563920356] [2022-04-07 15:24:38,769 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:38,769 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-07 15:24:38,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:38,769 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-07 15:24:38,793 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-07 15:24:38,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 15:24:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 15:24:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:24:38,794 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-07 15:24:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:39,075 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-07 15:24:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:24:39,075 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-07 15:24:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:39,075 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-07 15:24:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-07 15:24:39,077 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-07 15:24:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-07 15:24:39,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-07 15:24:39,110 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-07 15:24:39,111 INFO L225 Difference]: With dead ends: 45 [2022-04-07 15:24:39,111 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 15:24:39,111 INFO L912 BasicCegarLoop]: 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-07 15:24:39,111 INFO L913 BasicCegarLoop]: 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-07 15:24:39,112 INFO L914 BasicCegarLoop]: 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-07 15:24:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 15:24:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-07 15:24:39,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:39,122 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-07 15:24:39,123 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-07 15:24:39,123 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-07 15:24:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:39,124 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-07 15:24:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-07 15:24:39,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:39,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:39,124 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-07 15:24:39,125 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-07 15:24:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:39,126 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-07 15:24:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-07 15:24:39,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:39,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:39,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:39,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:39,126 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-07 15:24:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-07 15:24:39,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-07 15:24:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:39,128 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-07 15:24:39,128 INFO L479 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-07 15:24:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-07 15:24:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-07 15:24:39,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:39,128 INFO L499 BasicCegarLoop]: 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-07 15:24:39,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 15:24:39,333 WARN L460 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-07 15:24:39,333 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-07 15:24:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420978011] [2022-04-07 15:24:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:39,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509718874] [2022-04-07 15:24:39,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:24:39,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:39,350 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-07 15:24:39,351 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-07 15:24:39,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:24:39,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:39,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:24:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:39,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:39,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-07 15:24:39,824 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-07 15:24:39,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-07 15:24:39,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-07 15:24:39,825 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-07 15:24:39,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1772#true} is VALID [2022-04-07 15:24:39,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-07 15:24:39,825 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-07 15:24:39,826 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-07 15:24:39,826 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-07 15:24:39,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,827 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-07 15:24:39,827 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-07 15:24:39,827 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-07 15:24:39,827 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-07 15:24:39,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,828 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-07 15:24:39,829 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-07 15:24:39,829 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-07 15:24:39,829 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-07 15:24:39,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,830 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-07 15:24:39,830 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-07 15:24:39,831 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-07 15:24:39,831 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-07 15:24:39,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,831 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-07 15:24:39,832 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-07 15:24:39,832 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-07 15:24:39,832 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-07 15:24:39,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-07 15:24:39,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-07 15:24:39,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-07 15:24:39,837 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-07 15:24:39,838 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-07 15:24:39,838 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-07 15:24:39,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:39,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-07 15:24:39,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-07 15:24:39,839 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-07 15:24:39,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420978011] [2022-04-07 15:24:40,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509718874] [2022-04-07 15:24:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509718874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:40,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-07 15:24:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239452284] [2022-04-07 15:24:40,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:40,053 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-07 15:24:40,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:40,053 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-07 15:24:40,076 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-07 15:24:40,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:24:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:24:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 15:24:40,076 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-07 15:24:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:40,435 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-07 15:24:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 15:24:40,435 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-07 15:24:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:40,436 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-07 15:24:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-07 15:24:40,437 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-07 15:24:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-07 15:24:40,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-07 15:24:40,494 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-07 15:24:40,495 INFO L225 Difference]: With dead ends: 48 [2022-04-07 15:24:40,495 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 15:24:40,496 INFO L912 BasicCegarLoop]: 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-07 15:24:40,496 INFO L913 BasicCegarLoop]: 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-07 15:24:40,496 INFO L914 BasicCegarLoop]: 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-07 15:24:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 15:24:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-07 15:24:40,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:40,510 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-07 15:24:40,510 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-07 15:24:40,510 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-07 15:24:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:40,511 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-07 15:24:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-07 15:24:40,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:40,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:40,512 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-07 15:24:40,512 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-07 15:24:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:40,513 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-07 15:24:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-07 15:24:40,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:40,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:40,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:40,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:40,514 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-07 15:24:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-07 15:24:40,515 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-07 15:24:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:40,515 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-07 15:24:40,515 INFO L479 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-07 15:24:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-07 15:24:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 15:24:40,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:40,516 INFO L499 BasicCegarLoop]: 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-07 15:24:40,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 15:24:40,732 WARN L460 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-07 15:24:40,733 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-07 15:24:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:40,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412874741] [2022-04-07 15:24:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:40,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:40,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989150405] [2022-04-07 15:24:40,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 15:24:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:40,745 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-07 15:24:40,746 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-07 15:24:40,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-07 15:24:40,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:40,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:24:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:40,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:41,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2022-04-07 15:24:41,179 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-07 15:24:41,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} #60#return; {2203#true} is VALID [2022-04-07 15:24:41,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} call #t~ret5 := main(); {2203#true} is VALID [2022-04-07 15:24:41,179 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-07 15:24:41,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2203#true} is VALID [2022-04-07 15:24:41,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,180 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} #52#return; {2203#true} is VALID [2022-04-07 15:24:41,180 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-07 15:24:41,180 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-07 15:24:41,181 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-07 15:24:41,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,181 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-07 15:24:41,182 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-07 15:24:41,182 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-07 15:24:41,182 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-07 15:24:41,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,183 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-07 15:24:41,183 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-07 15:24:41,183 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-07 15:24:41,183 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-07 15:24:41,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,184 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-07 15:24:41,185 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-07 15:24:41,185 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-07 15:24:41,185 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-07 15:24:41,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,186 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-07 15:24:41,186 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-07 15:24:41,187 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-07 15:24:41,187 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-07 15:24:41,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,187 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-07 15:24:41,188 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-07 15:24:41,189 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-07 15:24:41,189 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-07 15:24:41,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-07 15:24:41,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-07 15:24:41,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-07 15:24:41,190 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-07 15:24:41,190 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-07 15:24:41,191 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-07 15:24:41,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:41,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2204#false} is VALID [2022-04-07 15:24:41,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2022-04-07 15:24:41,192 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-07 15:24:41,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:41,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412874741] [2022-04-07 15:24:41,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:41,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989150405] [2022-04-07 15:24:41,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989150405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:41,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:41,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-07 15:24:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191307081] [2022-04-07 15:24:41,406 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:41,406 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-07 15:24:41,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:41,406 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-07 15:24:41,434 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-07 15:24:41,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 15:24:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:41,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 15:24:41,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-07 15:24:41,435 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-07 15:24:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:41,840 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-07 15:24:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 15:24:41,840 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-07 15:24:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:41,841 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-07 15:24:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-07 15:24:41,842 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-07 15:24:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-07 15:24:41,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-07 15:24:41,881 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-07 15:24:41,882 INFO L225 Difference]: With dead ends: 51 [2022-04-07 15:24:41,882 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 15:24:41,882 INFO L912 BasicCegarLoop]: 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-07 15:24:41,883 INFO L913 BasicCegarLoop]: 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-07 15:24:41,883 INFO L914 BasicCegarLoop]: 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-07 15:24:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 15:24:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-07 15:24:41,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:41,896 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-07 15:24:41,896 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-07 15:24:41,897 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-07 15:24:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:41,898 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-07 15:24:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 15:24:41,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:41,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:41,898 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-07 15:24:41,898 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-07 15:24:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:41,899 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-07 15:24:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 15:24:41,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:41,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:41,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:41,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:41,900 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-07 15:24:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-07 15:24:41,901 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-07 15:24:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:41,901 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-07 15:24:41,902 INFO L479 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-07 15:24:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 15:24:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-07 15:24:41,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:41,902 INFO L499 BasicCegarLoop]: 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-07 15:24:41,909 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-07 15:24:42,107 WARN L460 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-07 15:24:42,107 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-07 15:24:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466834405] [2022-04-07 15:24:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:42,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:42,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461842240] [2022-04-07 15:24:42,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 15:24:42,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:42,119 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-07 15:24:42,120 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-07 15:24:42,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-07 15:24:42,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:42,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-07 15:24:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:42,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:42,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-07 15:24:42,677 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-07 15:24:42,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #60#return; {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret5 := main(); {2672#true} is VALID [2022-04-07 15:24:42,678 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-07 15:24:42,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {2672#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2672#true} {2672#true} #52#return; {2672#true} is VALID [2022-04-07 15:24:42,678 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-07 15:24:42,679 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-07 15:24:42,679 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-07 15:24:42,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,680 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-07 15:24:42,680 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-07 15:24:42,680 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-07 15:24:42,681 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-07 15:24:42,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,681 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-07 15:24:42,682 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-07 15:24:42,682 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-07 15:24:42,682 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-07 15:24:42,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,683 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-07 15:24:42,683 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-07 15:24:42,684 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-07 15:24:42,684 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-07 15:24:42,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,685 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-07 15:24:42,685 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-07 15:24:42,685 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-07 15:24:42,685 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-07 15:24:42,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,686 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-07 15:24:42,687 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-07 15:24:42,687 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-07 15:24:42,687 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-07 15:24:42,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,688 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-07 15:24:42,688 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-07 15:24:42,689 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-07 15:24:42,689 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-07 15:24:42,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-07 15:24:42,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-07 15:24:42,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-07 15:24:42,689 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-07 15:24:42,690 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-07 15:24:42,691 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-07 15:24:42,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {2868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:42,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {2872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-07 15:24:42,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-07 15:24:42,692 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-07 15:24:42,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466834405] [2022-04-07 15:24:43,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461842240] [2022-04-07 15:24:43,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461842240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:43,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:43,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-07 15:24:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733162097] [2022-04-07 15:24:43,010 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:43,011 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-07 15:24:43,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:43,011 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-07 15:24:43,042 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-07 15:24:43,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 15:24:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 15:24:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 15:24:43,043 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-07 15:24:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:43,548 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-07 15:24:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 15:24:43,548 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-07 15:24:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:43,549 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-07 15:24:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-07 15:24:43,550 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-07 15:24:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-07 15:24:43,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-07 15:24:43,587 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-07 15:24:43,588 INFO L225 Difference]: With dead ends: 54 [2022-04-07 15:24:43,588 INFO L226 Difference]: Without dead ends: 49 [2022-04-07 15:24:43,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-07 15:24:43,588 INFO L913 BasicCegarLoop]: 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-07 15:24:43,589 INFO L914 BasicCegarLoop]: 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-07 15:24:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-07 15:24:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-07 15:24:43,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:43,603 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-07 15:24:43,603 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-07 15:24:43,604 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-07 15:24:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:43,605 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-07 15:24:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-07 15:24:43,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:43,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:43,606 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-07 15:24:43,606 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-07 15:24:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:43,607 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-07 15:24:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-07 15:24:43,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:43,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:43,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:43,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:43,607 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-07 15:24:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-07 15:24:43,608 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-07 15:24:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:43,609 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-07 15:24:43,609 INFO L479 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-07 15:24:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-07 15:24:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-07 15:24:43,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:43,609 INFO L499 BasicCegarLoop]: 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-07 15:24:43,620 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-07 15:24:43,813 WARN L460 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-07 15:24:43,814 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 7 times [2022-04-07 15:24:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074098667] [2022-04-07 15:24:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:43,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:43,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770009116] [2022-04-07 15:24:43,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 15:24:43,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:43,848 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-07 15:24:43,852 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-07 15:24:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-07 15:24:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:44,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:44,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-07 15:24:44,623 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-07 15:24:44,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #60#return; {3179#true} is VALID [2022-04-07 15:24:44,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret5 := main(); {3179#true} is VALID [2022-04-07 15:24:44,624 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-07 15:24:44,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {3179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3179#true} is VALID [2022-04-07 15:24:44,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3179#true} {3179#true} #52#return; {3179#true} is VALID [2022-04-07 15:24:44,627 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-07 15:24:44,628 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-07 15:24:44,628 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-07 15:24:44,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,628 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-07 15:24:44,629 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-07 15:24:44,629 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-07 15:24:44,629 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-07 15:24:44,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,630 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-07 15:24:44,630 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-07 15:24:44,630 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-07 15:24:44,630 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-07 15:24:44,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,631 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-07 15:24:44,634 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-07 15:24:44,634 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-07 15:24:44,634 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-07 15:24:44,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,635 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-07 15:24:44,635 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-07 15:24:44,636 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-07 15:24:44,636 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-07 15:24:44,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,636 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-07 15:24:44,637 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-07 15:24:44,637 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-07 15:24:44,637 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-07 15:24:44,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,638 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-07 15:24:44,638 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-07 15:24:44,638 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-07 15:24:44,638 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-07 15:24:44,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,639 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-07 15:24:44,639 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-07 15:24:44,640 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-07 15:24:44,640 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-07 15:24:44,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-07 15:24:44,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-07 15:24:44,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-07 15:24:44,640 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-07 15:24:44,641 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-07 15:24:44,641 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-07 15:24:44,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:44,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {3401#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3180#false} is VALID [2022-04-07 15:24:44,642 INFO L290 TraceCheckUtils]: 71: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-07 15:24:44,642 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-07 15:24:44,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074098667] [2022-04-07 15:24:44,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770009116] [2022-04-07 15:24:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770009116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:44,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-07 15:24:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170927583] [2022-04-07 15:24:44,879 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:44,880 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-07 15:24:44,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:44,880 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-07 15:24:44,913 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-07 15:24:44,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 15:24:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 15:24:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-07 15:24:44,914 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-07 15:24:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:45,544 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-07 15:24:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:24:45,544 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-07 15:24:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:45,545 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-07 15:24:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-07 15:24:45,547 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-07 15:24:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-07 15:24:45,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-07 15:24:45,604 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-07 15:24:45,605 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:24:45,605 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 15:24:45,605 INFO L912 BasicCegarLoop]: 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-07 15:24:45,605 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:24:45,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 15:24:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 15:24:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-07 15:24:45,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:45,633 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-07 15:24:45,634 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-07 15:24:45,634 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-07 15:24:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:45,636 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-07 15:24:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-07 15:24:45,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:45,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:45,637 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-07 15:24:45,637 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-07 15:24:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:45,638 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-07 15:24:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-07 15:24:45,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:45,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:45,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:45,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:45,639 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-07 15:24:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-07 15:24:45,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-07 15:24:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:45,640 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-07 15:24:45,640 INFO L479 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-07 15:24:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-07 15:24:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-07 15:24:45,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:45,641 INFO L499 BasicCegarLoop]: 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-07 15:24:45,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-07 15:24:45,846 WARN L460 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-07 15:24:45,846 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 8 times [2022-04-07 15:24:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192305949] [2022-04-07 15:24:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:45,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:45,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904300254] [2022-04-07 15:24:45,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:24:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:45,870 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-07 15:24:45,871 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-07 15:24:46,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:24:46,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:46,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-07 15:24:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:46,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:46,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {3724#true} call ULTIMATE.init(); {3724#true} is VALID [2022-04-07 15:24:46,939 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-07 15:24:46,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3724#true} {3724#true} #60#return; {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {3724#true} call #t~ret5 := main(); {3724#true} is VALID [2022-04-07 15:24:46,939 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-07 15:24:46,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {3724#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3724#true} {3724#true} #52#return; {3724#true} is VALID [2022-04-07 15:24:46,940 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-07 15:24:46,940 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-07 15:24:46,940 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-07 15:24:46,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,941 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-07 15:24:46,941 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-07 15:24:46,942 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-07 15:24:46,942 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-07 15:24:46,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,942 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-07 15:24:46,943 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-07 15:24:46,943 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-07 15:24:46,943 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-07 15:24:46,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,944 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-07 15:24:46,944 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-07 15:24:46,945 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-07 15:24:46,945 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-07 15:24:46,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,946 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-07 15:24:46,946 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-07 15:24:46,946 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-07 15:24:46,947 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-07 15:24:46,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,947 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-07 15:24:46,948 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-07 15:24:46,948 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-07 15:24:46,948 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-07 15:24:46,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,949 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-07 15:24:46,949 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-07 15:24:46,950 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-07 15:24:46,950 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-07 15:24:46,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,950 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-07 15:24:46,951 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-07 15:24:46,951 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-07 15:24:46,951 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-07 15:24:46,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,952 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-07 15:24:46,952 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-07 15:24:46,953 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-07 15:24:46,953 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-07 15:24:46,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-07 15:24:46,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-07 15:24:46,953 INFO L290 TraceCheckUtils]: 72: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-07 15:24:46,953 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-07 15:24:46,954 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-07 15:24:46,955 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-07 15:24:46,955 INFO L290 TraceCheckUtils]: 76: Hoare triple {3964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:46,955 INFO L290 TraceCheckUtils]: 77: Hoare triple {3968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3725#false} is VALID [2022-04-07 15:24:46,955 INFO L290 TraceCheckUtils]: 78: Hoare triple {3725#false} assume !false; {3725#false} is VALID [2022-04-07 15:24:46,956 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-07 15:24:46,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:47,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192305949] [2022-04-07 15:24:47,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:47,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904300254] [2022-04-07 15:24:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904300254] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:47,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-07 15:24:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338471430] [2022-04-07 15:24:47,239 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:47,240 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-07 15:24:47,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:47,240 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-07 15:24:47,276 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-07 15:24:47,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 15:24:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 15:24:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 15:24:47,277 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-07 15:24:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:47,998 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-07 15:24:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 15:24:47,998 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-07 15:24:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:47,998 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-07 15:24:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-07 15:24:47,999 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-07 15:24:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-07 15:24:48,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-07 15:24:48,037 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-07 15:24:48,038 INFO L225 Difference]: With dead ends: 60 [2022-04-07 15:24:48,038 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 15:24:48,038 INFO L912 BasicCegarLoop]: 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-07 15:24:48,041 INFO L913 BasicCegarLoop]: 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-07 15:24:48,042 INFO L914 BasicCegarLoop]: 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-07 15:24:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 15:24:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-07 15:24:48,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:48,064 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-07 15:24:48,064 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-07 15:24:48,064 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-07 15:24:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:48,065 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-07 15:24:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-07 15:24:48,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:48,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:48,066 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-07 15:24:48,066 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-07 15:24:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:48,067 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-07 15:24:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-07 15:24:48,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:48,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:48,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:48,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:48,067 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-07 15:24:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-07 15:24:48,068 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-07 15:24:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:48,069 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-07 15:24:48,069 INFO L479 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-07 15:24:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-07 15:24:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-07 15:24:48,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:48,069 INFO L499 BasicCegarLoop]: 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-07 15:24:48,088 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-07 15:24:48,287 WARN L460 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-07 15:24:48,288 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 9 times [2022-04-07 15:24:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:48,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199067125] [2022-04-07 15:24:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:48,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:48,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063095805] [2022-04-07 15:24:48,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:24:48,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:48,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:48,300 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-07 15:24:48,301 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-07 15:24:48,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-07 15:24:48,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:48,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-07 15:24:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:49,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2022-04-07 15:24:49,172 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-07 15:24:49,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #60#return; {4307#true} is VALID [2022-04-07 15:24:49,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2022-04-07 15:24:49,172 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-07 15:24:49,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {4307#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4307#true} is VALID [2022-04-07 15:24:49,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4307#true} {4307#true} #52#return; {4307#true} is VALID [2022-04-07 15:24:49,173 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-07 15:24:49,173 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-07 15:24:49,173 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-07 15:24:49,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,174 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-07 15:24:49,174 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-07 15:24:49,175 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-07 15:24:49,175 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-07 15:24:49,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,176 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-07 15:24:49,176 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-07 15:24:49,176 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-07 15:24:49,176 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-07 15:24:49,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,177 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-07 15:24:49,177 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-07 15:24:49,178 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-07 15:24:49,178 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-07 15:24:49,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,179 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-07 15:24:49,180 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-07 15:24:49,180 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-07 15:24:49,180 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-07 15:24:49,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,181 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-07 15:24:49,181 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-07 15:24:49,182 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-07 15:24:49,182 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-07 15:24:49,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,182 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-07 15:24:49,183 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-07 15:24:49,183 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-07 15:24:49,183 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-07 15:24:49,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,184 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-07 15:24:49,184 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-07 15:24:49,184 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-07 15:24:49,184 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-07 15:24:49,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,185 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-07 15:24:49,186 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-07 15:24:49,186 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-07 15:24:49,186 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-07 15:24:49,186 INFO L290 TraceCheckUtils]: 70: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,187 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-07 15:24:49,187 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-07 15:24:49,188 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-07 15:24:49,188 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-07 15:24:49,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-07 15:24:49,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-07 15:24:49,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-07 15:24:49,188 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-07 15:24:49,189 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-07 15:24:49,189 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-07 15:24:49,190 INFO L290 TraceCheckUtils]: 83: Hoare triple {4569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:49,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {4573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4308#false} is VALID [2022-04-07 15:24:49,190 INFO L290 TraceCheckUtils]: 85: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-04-07 15:24:49,190 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-07 15:24:49,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199067125] [2022-04-07 15:24:49,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063095805] [2022-04-07 15:24:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063095805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:49,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-07 15:24:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805699783] [2022-04-07 15:24:49,556 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:49,556 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-07 15:24:49,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:49,557 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-07 15:24:49,586 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-07 15:24:49,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 15:24:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 15:24:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-07 15:24:49,588 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-07 15:24:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:50,490 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-07 15:24:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 15:24:50,491 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-07 15:24:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-07 15:24:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-07 15:24:50,492 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-07 15:24:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-07 15:24:50,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-07 15:24:50,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:24:50,538 INFO L225 Difference]: With dead ends: 63 [2022-04-07 15:24:50,538 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 15:24:50,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-07 15:24:50,539 INFO L913 BasicCegarLoop]: 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-07 15:24:50,539 INFO L914 BasicCegarLoop]: 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-07 15:24:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 15:24:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-07 15:24:50,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:50,560 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-07 15:24:50,561 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-07 15:24:50,561 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-07 15:24:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:50,562 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-07 15:24:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-07 15:24:50,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:50,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:50,562 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-07 15:24:50,563 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-07 15:24:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:50,568 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-07 15:24:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-07 15:24:50,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:50,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:50,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:50,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:50,568 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-07 15:24:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-07 15:24:50,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-07 15:24:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:50,569 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-07 15:24:50,569 INFO L479 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-07 15:24:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-07 15:24:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-07 15:24:50,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:50,570 INFO L499 BasicCegarLoop]: 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-07 15:24:50,575 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-07 15:24:50,775 WARN L460 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-07 15:24:50,775 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 10 times [2022-04-07 15:24:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:50,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099189340] [2022-04-07 15:24:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:50,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874309448] [2022-04-07 15:24:50,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:24:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:50,786 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-07 15:24:50,788 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-07 15:24:51,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:24:51,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:51,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-07 15:24:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:51,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:51,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2022-04-07 15:24:51,805 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-07 15:24:51,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #60#return; {4972#true} is VALID [2022-04-07 15:24:51,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret5 := main(); {4972#true} is VALID [2022-04-07 15:24:51,805 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-07 15:24:51,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {4972#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4972#true} is VALID [2022-04-07 15:24:51,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4972#true} {4972#true} #52#return; {4972#true} is VALID [2022-04-07 15:24:51,806 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-07 15:24:51,806 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-07 15:24:51,806 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-07 15:24:51,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,807 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-07 15:24:51,807 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-07 15:24:51,808 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-07 15:24:51,808 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-07 15:24:51,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,808 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-07 15:24:51,808 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-07 15:24:51,809 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-07 15:24:51,809 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-07 15:24:51,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,809 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-07 15:24:51,810 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-07 15:24:51,810 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-07 15:24:51,810 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-07 15:24:51,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,810 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-07 15:24:51,811 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-07 15:24:51,811 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-07 15:24:51,811 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-07 15:24:51,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,816 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-07 15:24:51,816 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-07 15:24:51,816 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-07 15:24:51,816 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-07 15:24:51,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,817 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-07 15:24:51,817 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-07 15:24:51,818 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-07 15:24:51,818 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-07 15:24:51,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,818 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-07 15:24:51,818 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-07 15:24:51,819 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-07 15:24:51,819 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-07 15:24:51,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,819 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-07 15:24:51,820 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-07 15:24:51,820 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-07 15:24:51,820 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-07 15:24:51,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,820 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-07 15:24:51,821 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-07 15:24:51,821 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-07 15:24:51,821 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-07 15:24:51,821 INFO L290 TraceCheckUtils]: 77: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,822 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-07 15:24:51,822 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-07 15:24:51,822 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-07 15:24:51,822 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-07 15:24:51,822 INFO L290 TraceCheckUtils]: 84: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-07 15:24:51,822 INFO L290 TraceCheckUtils]: 85: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-07 15:24:51,822 INFO L290 TraceCheckUtils]: 86: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-07 15:24:51,823 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-07 15:24:51,823 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-07 15:24:51,824 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-07 15:24:51,824 INFO L290 TraceCheckUtils]: 90: Hoare triple {5256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:51,824 INFO L290 TraceCheckUtils]: 91: Hoare triple {5260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4973#false} is VALID [2022-04-07 15:24:51,824 INFO L290 TraceCheckUtils]: 92: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2022-04-07 15:24:51,825 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-07 15:24:51,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099189340] [2022-04-07 15:24:52,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874309448] [2022-04-07 15:24:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874309448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:52,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:52,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-07 15:24:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599607730] [2022-04-07 15:24:52,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:52,094 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-07 15:24:52,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:52,095 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-07 15:24:52,123 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-07 15:24:52,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 15:24:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 15:24:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:24:52,131 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-07 15:24:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:52,936 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-07 15:24:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 15:24:52,938 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-07 15:24:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:52,941 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-07 15:24:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-07 15:24:52,943 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-07 15:24:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-07 15:24:52,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-07 15:24:52,983 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-07 15:24:52,985 INFO L225 Difference]: With dead ends: 66 [2022-04-07 15:24:52,985 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 15:24:52,985 INFO L912 BasicCegarLoop]: 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-07 15:24:52,986 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:24:52,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 15:24:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 15:24:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-07 15:24:53,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:53,007 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-07 15:24:53,007 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-07 15:24:53,011 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-07 15:24:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:53,013 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-07 15:24:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-07 15:24:53,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:53,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:53,013 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-07 15:24:53,013 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-07 15:24:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:53,014 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-07 15:24:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-07 15:24:53,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:53,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:53,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:53,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:53,015 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-07 15:24:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-07 15:24:53,016 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-07 15:24:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:53,017 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-07 15:24:53,017 INFO L479 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-07 15:24:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-07 15:24:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 15:24:53,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:53,017 INFO L499 BasicCegarLoop]: 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-07 15:24:53,023 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-07 15:24:53,222 WARN L460 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-07 15:24:53,222 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 11 times [2022-04-07 15:24:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:53,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548293845] [2022-04-07 15:24:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:53,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:53,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39741928] [2022-04-07 15:24:53,233 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 15:24:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:53,242 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-07 15:24:53,242 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-07 15:24:53,815 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-07 15:24:53,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:53,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-07 15:24:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:53,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:54,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {5631#true} call ULTIMATE.init(); {5631#true} is VALID [2022-04-07 15:24:54,409 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-07 15:24:54,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5631#true} {5631#true} #60#return; {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {5631#true} call #t~ret5 := main(); {5631#true} is VALID [2022-04-07 15:24:54,409 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-07 15:24:54,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {5631#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5631#true} {5631#true} #52#return; {5631#true} is VALID [2022-04-07 15:24:54,410 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-07 15:24:54,410 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-07 15:24:54,410 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-07 15:24:54,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,411 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-07 15:24:54,411 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-07 15:24:54,412 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-07 15:24:54,412 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-07 15:24:54,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,412 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-07 15:24:54,413 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-07 15:24:54,413 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-07 15:24:54,413 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-07 15:24:54,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,414 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-07 15:24:54,414 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-07 15:24:54,415 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-07 15:24:54,415 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-07 15:24:54,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,415 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-07 15:24:54,416 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-07 15:24:54,416 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-07 15:24:54,416 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-07 15:24:54,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,417 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-07 15:24:54,417 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-07 15:24:54,418 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-07 15:24:54,418 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-07 15:24:54,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,419 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-07 15:24:54,419 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-07 15:24:54,419 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-07 15:24:54,419 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-07 15:24:54,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,420 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-07 15:24:54,420 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-07 15:24:54,421 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-07 15:24:54,421 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-07 15:24:54,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,422 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-07 15:24:54,422 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-07 15:24:54,422 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-07 15:24:54,422 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-07 15:24:54,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,423 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-07 15:24:54,424 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-07 15:24:54,424 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-07 15:24:54,424 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-07 15:24:54,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,425 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-07 15:24:54,425 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-07 15:24:54,425 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-07 15:24:54,425 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-07 15:24:54,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,426 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-07 15:24:54,427 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-07 15:24:54,427 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-07 15:24:54,427 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-07 15:24:54,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-07 15:24:54,427 INFO L290 TraceCheckUtils]: 92: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-07 15:24:54,427 INFO L290 TraceCheckUtils]: 93: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-07 15:24:54,428 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-07 15:24:54,428 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-07 15:24:54,429 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-07 15:24:54,429 INFO L290 TraceCheckUtils]: 97: Hoare triple {5937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:54,429 INFO L290 TraceCheckUtils]: 98: Hoare triple {5941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5632#false} is VALID [2022-04-07 15:24:54,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {5632#false} assume !false; {5632#false} is VALID [2022-04-07 15:24:54,430 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-07 15:24:54,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:24:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:24:55,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548293845] [2022-04-07 15:24:55,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:24:55,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39741928] [2022-04-07 15:24:55,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39741928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:24:55,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:24:55,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-07 15:24:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127866132] [2022-04-07 15:24:55,415 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:24:55,415 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-07 15:24:55,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:24:55,416 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-07 15:24:55,451 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-07 15:24:55,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 15:24:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:24:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 15:24:55,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2022-04-07 15:24:55,452 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-07 15:24:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:56,628 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-07 15:24:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 15:24:56,628 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-07 15:24:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:56,628 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-07 15:24:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-07 15:24:56,629 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-07 15:24:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-07 15:24:56,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-07 15:24:56,687 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-07 15:24:56,688 INFO L225 Difference]: With dead ends: 69 [2022-04-07 15:24:56,688 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 15:24:56,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-04-07 15:24:56,689 INFO L913 BasicCegarLoop]: 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-07 15:24:56,689 INFO L914 BasicCegarLoop]: 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-07 15:24:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 15:24:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-07 15:24:56,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:56,724 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-07 15:24:56,724 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-07 15:24:56,724 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-07 15:24:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:56,725 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-07 15:24:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-07 15:24:56,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:56,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:56,726 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-07 15:24:56,726 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-07 15:24:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:56,727 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-07 15:24:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-07 15:24:56,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:56,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:56,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:56,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:56,727 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-07 15:24:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-07 15:24:56,728 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-07 15:24:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:56,729 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-07 15:24:56,729 INFO L479 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-07 15:24:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-07 15:24:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-07 15:24:56,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:56,730 INFO L499 BasicCegarLoop]: 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-07 15:24:56,749 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-07 15:24:56,934 WARN L460 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-07 15:24:56,934 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 12 times [2022-04-07 15:24:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:56,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310498959] [2022-04-07 15:24:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:56,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475810790] [2022-04-07 15:24:56,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 15:24:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:56,947 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-07 15:24:56,947 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-07 15:24:57,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-07 15:24:57,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:57,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-07 15:24:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:57,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:57,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {6548#true} call ULTIMATE.init(); {6548#true} is VALID [2022-04-07 15:24:57,817 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-07 15:24:57,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6548#true} {6548#true} #60#return; {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {6548#true} call #t~ret5 := main(); {6548#true} is VALID [2022-04-07 15:24:57,817 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-07 15:24:57,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {6548#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6548#true} {6548#true} #52#return; {6548#true} is VALID [2022-04-07 15:24:57,818 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-07 15:24:57,818 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-07 15:24:57,818 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-07 15:24:57,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,819 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-07 15:24:57,819 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-07 15:24:57,819 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-07 15:24:57,819 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-07 15:24:57,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,820 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-07 15:24:57,820 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-07 15:24:57,820 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-07 15:24:57,821 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-07 15:24:57,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,821 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-07 15:24:57,821 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-07 15:24:57,822 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-07 15:24:57,822 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-07 15:24:57,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,822 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-07 15:24:57,823 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-07 15:24:57,823 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-07 15:24:57,823 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-07 15:24:57,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,823 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-07 15:24:57,824 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-07 15:24:57,824 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-07 15:24:57,824 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-07 15:24:57,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,825 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-07 15:24:57,825 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-07 15:24:57,825 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-07 15:24:57,825 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-07 15:24:57,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,826 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-07 15:24:57,826 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-07 15:24:57,827 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-07 15:24:57,827 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-07 15:24:57,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,827 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-07 15:24:57,828 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-07 15:24:57,828 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-07 15:24:57,828 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-07 15:24:57,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,828 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-07 15:24:57,829 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-07 15:24:57,829 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-07 15:24:57,829 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-07 15:24:57,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,829 INFO L290 TraceCheckUtils]: 78: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,830 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-07 15:24:57,830 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-07 15:24:57,830 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-07 15:24:57,830 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-07 15:24:57,831 INFO L290 TraceCheckUtils]: 84: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-07 15:24:57,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-07 15:24:57,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-07 15:24:57,831 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-07 15:24:57,831 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-07 15:24:57,832 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-07 15:24:57,832 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-07 15:24:57,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:57,832 INFO L290 TraceCheckUtils]: 92: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:57,832 INFO L290 TraceCheckUtils]: 93: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:57,834 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-07 15:24:57,835 INFO L290 TraceCheckUtils]: 95: Hoare triple {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-07 15:24:57,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} assume !false; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-07 15:24:57,835 INFO L272 TraceCheckUtils]: 97: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-07 15:24:57,835 INFO L290 TraceCheckUtils]: 98: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:57,836 INFO L290 TraceCheckUtils]: 99: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:57,836 INFO L290 TraceCheckUtils]: 100: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:57,836 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} #54#return; {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-07 15:24:57,837 INFO L290 TraceCheckUtils]: 102: Hoare triple {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6876#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-07 15:24:57,837 INFO L272 TraceCheckUtils]: 103: Hoare triple {6876#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:24:57,838 INFO L290 TraceCheckUtils]: 104: Hoare triple {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:57,838 INFO L290 TraceCheckUtils]: 105: Hoare triple {6884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6549#false} is VALID [2022-04-07 15:24:57,838 INFO L290 TraceCheckUtils]: 106: Hoare triple {6549#false} assume !false; {6549#false} is VALID [2022-04-07 15:24:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 90 proven. 236 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-07 15:24:57,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:25:26,534 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~y~0 1))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 3 (* .cse0 .cse0))) (< (+ 2 c_main_~c~0) c_main_~k~0) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 6) .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ c_main_~c~0 1)))) is different from false [2022-04-07 15:25:34,619 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 5) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (<= c_main_~k~0 (+ 2 c_main_~c~0)) (not (= (mod (+ (* (- 6) .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (< (+ 3 c_main_~c~0) c_main_~k~0))) is different from false [2022-04-07 15:25:42,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 7 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (< (+ c_main_~c~0 4) c_main_~k~0) (<= c_main_~k~0 (+ 3 c_main_~c~0)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6))) 4) 0)))) is different from false [2022-04-07 15:26:47,651 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0))))) (not (= (mod (let ((.cse0 (+ 6 c_main_~y~0))) (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0))) 4) 0))) is different from false [2022-04-07 15:26:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:26:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310498959] [2022-04-07 15:26:49,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:26:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475810790] [2022-04-07 15:26:49,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475810790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:26:49,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:26:49,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-07 15:26:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82929287] [2022-04-07 15:26:49,716 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:26:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-07 15:26:49,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:26:49,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-07 15:26:49,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:26:49,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 15:26:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:26:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 15:26:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=737, Unknown=10, NotChecked=236, Total=1122 [2022-04-07 15:26:49,773 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-07 15:26:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:51,667 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-07 15:26:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 15:26:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-07 15:26:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:26:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-07 15:26:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-07 15:26:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-07 15:26:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-07 15:26:51,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-07 15:26:51,731 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-07 15:26:51,732 INFO L225 Difference]: With dead ends: 72 [2022-04-07 15:26:51,732 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 15:26:51,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=160, Invalid=902, Unknown=10, NotChecked=260, Total=1332 [2022-04-07 15:26:51,733 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 15:26:51,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 489 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 15:26:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 15:26:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-07 15:26:51,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:26:51,763 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-07 15:26:51,763 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-07 15:26:51,763 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-07 15:26:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:51,764 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-07 15:26:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-07 15:26:51,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:26:51,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:26:51,765 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-07 15:26:51,765 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-07 15:26:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:51,766 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-07 15:26:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-07 15:26:51,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:26:51,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:26:51,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:26:51,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:26:51,767 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-07 15:26:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-07 15:26:51,768 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-07 15:26:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:26:51,768 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-07 15:26:51,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-07 15:26:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-07 15:26:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-07 15:26:51,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:26:51,769 INFO L499 BasicCegarLoop]: 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-07 15:26:51,789 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-07 15:26:51,969 WARN L460 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-07 15:26:51,970 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:26:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:26:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 13 times [2022-04-07 15:26:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:26:51,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618081924] [2022-04-07 15:26:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:26:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:26:51,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:26:51,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281668488] [2022-04-07 15:26:51,980 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 15:26:51,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:26:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:26:51,980 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-07 15:26:51,981 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-07 15:26:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:26:52,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-07 15:26:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:26:52,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:26:53,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {7424#true} call ULTIMATE.init(); {7424#true} is VALID [2022-04-07 15:26:53,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {7424#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7424#true} {7424#true} #60#return; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {7424#true} call #t~ret5 := main(); {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {7424#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {7424#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7424#true} {7424#true} #52#return; {7424#true} is VALID [2022-04-07 15:26:53,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {7424#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:26:53,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:26:53,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7424#true} {7462#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:26:53,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:26:53,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:26:53,551 INFO L272 TraceCheckUtils]: 20: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,552 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7424#true} {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:26:53,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:26:53,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:26:53,553 INFO L272 TraceCheckUtils]: 27: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,553 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7424#true} {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:26:53,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-07 15:26:53,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-07 15:26:53,554 INFO L272 TraceCheckUtils]: 34: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,555 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7424#true} {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-07 15:26:53,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:26:53,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:26:53,556 INFO L272 TraceCheckUtils]: 41: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,556 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7424#true} {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:26:53,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:26:53,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:26:53,557 INFO L272 TraceCheckUtils]: 48: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,558 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7424#true} {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:26:53,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:26:53,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:26:53,558 INFO L272 TraceCheckUtils]: 55: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,559 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7424#true} {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:26:53,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:26:53,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:26:53,560 INFO L272 TraceCheckUtils]: 62: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,561 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7424#true} {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:26:53,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:26:53,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:26:53,561 INFO L272 TraceCheckUtils]: 69: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,562 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7424#true} {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:26:53,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:26:53,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:26:53,563 INFO L272 TraceCheckUtils]: 76: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,563 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7424#true} {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:26:53,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:26:53,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:26:53,564 INFO L272 TraceCheckUtils]: 83: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,565 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7424#true} {7682#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:26:53,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:26:53,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:26:53,566 INFO L272 TraceCheckUtils]: 90: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,566 INFO L290 TraceCheckUtils]: 91: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-07 15:26:53,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-07 15:26:53,566 INFO L290 TraceCheckUtils]: 93: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-07 15:26:53,566 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7424#true} {7704#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:26:53,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:26:53,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {7726#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:26:53,567 INFO L272 TraceCheckUtils]: 97: Hoare triple {7726#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:26:53,568 INFO L290 TraceCheckUtils]: 99: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:26:53,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:26:53,569 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7726#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-07 15:26:53,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-07 15:26:53,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} assume !false; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-07 15:26:53,570 INFO L272 TraceCheckUtils]: 104: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-07 15:26:53,571 INFO L290 TraceCheckUtils]: 105: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:26:53,571 INFO L290 TraceCheckUtils]: 106: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:26:53,571 INFO L290 TraceCheckUtils]: 107: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:26:53,572 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} #54#return; {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:26:53,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7774#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:26:53,573 INFO L272 TraceCheckUtils]: 110: Hoare triple {7774#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:26:53,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:26:53,574 INFO L290 TraceCheckUtils]: 112: Hoare triple {7782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7425#false} is VALID [2022-04-07 15:26:53,574 INFO L290 TraceCheckUtils]: 113: Hoare triple {7425#false} assume !false; {7425#false} is VALID [2022-04-07 15:26:53,574 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-07 15:26:53,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:25,604 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-07 15:27:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:25,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618081924] [2022-04-07 15:27:25,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:25,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281668488] [2022-04-07 15:27:25,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281668488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:25,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:25,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-07 15:27:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124977517] [2022-04-07 15:27:25,607 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:25,607 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-07 15:27:25,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:25,607 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-07 15:27:25,665 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-07 15:27:25,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-07 15:27:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:25,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-07 15:27:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=670, Unknown=2, NotChecked=52, Total=812 [2022-04-07 15:27:25,666 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-07 15:27:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:28,105 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-07 15:27:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 15:27:28,105 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-07 15:27:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:28,105 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-07 15:27:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-07 15:27:28,107 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-07 15:27:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-07 15:27:28,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-07 15:27:28,176 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-07 15:27:28,177 INFO L225 Difference]: With dead ends: 75 [2022-04-07 15:27:28,177 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 15:27:28,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=109, Invalid=823, Unknown=2, NotChecked=58, Total=992 [2022-04-07 15:27:28,178 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:28,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 594 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 15:27:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 15:27:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 15:27:28,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:28,221 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-07 15:27:28,221 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-07 15:27:28,221 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-07 15:27:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:28,223 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-07 15:27:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-07 15:27:28,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:28,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:28,224 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-07 15:27:28,224 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-07 15:27:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:28,226 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-07 15:27:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-07 15:27:28,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:28,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:28,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:28,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:28,227 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-07 15:27:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-07 15:27:28,228 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-07 15:27:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:28,228 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-07 15:27:28,228 INFO L479 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-07 15:27:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-07 15:27:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-07 15:27:28,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:28,229 INFO L499 BasicCegarLoop]: 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-07 15:27:28,236 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-07 15:27:28,434 WARN L460 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-07 15:27:28,434 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 14 times [2022-04-07 15:27:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:28,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121957617] [2022-04-07 15:27:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:28,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:28,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165109652] [2022-04-07 15:27:28,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:27:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:28,449 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-07 15:27:28,455 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-07 15:27:28,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:27:28,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:28,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-07 15:27:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:29,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {8206#true} call ULTIMATE.init(); {8206#true} is VALID [2022-04-07 15:27:29,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {8206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {8206#true} is VALID [2022-04-07 15:27:29,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8206#true} {8206#true} #60#return; {8206#true} is VALID [2022-04-07 15:27:29,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {8206#true} call #t~ret5 := main(); {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {8206#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {8206#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8206#true} {8206#true} #52#return; {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {8206#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:29,458 INFO L272 TraceCheckUtils]: 13: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,459 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8206#true} {8244#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:29,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:29,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:29,459 INFO L272 TraceCheckUtils]: 20: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,460 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8206#true} {8266#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:29,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:27:29,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:27:29,460 INFO L272 TraceCheckUtils]: 27: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,461 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8206#true} {8288#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:27:29,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:29,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:29,461 INFO L272 TraceCheckUtils]: 34: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,462 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8206#true} {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:29,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:27:29,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:27:29,462 INFO L272 TraceCheckUtils]: 41: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,463 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8206#true} {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:27:29,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:29,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:29,463 INFO L272 TraceCheckUtils]: 48: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,464 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8206#true} {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:29,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,465 INFO L272 TraceCheckUtils]: 55: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,466 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8206#true} {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:29,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:29,466 INFO L272 TraceCheckUtils]: 62: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,467 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8206#true} {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:29,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:27:29,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:27:29,467 INFO L272 TraceCheckUtils]: 69: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,471 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8206#true} {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:27:29,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:29,472 INFO L290 TraceCheckUtils]: 75: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:29,472 INFO L272 TraceCheckUtils]: 76: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,472 INFO L290 TraceCheckUtils]: 77: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,472 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8206#true} {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:29,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-07 15:27:29,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-07 15:27:29,473 INFO L272 TraceCheckUtils]: 83: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,473 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8206#true} {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-07 15:27:29,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:29,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:29,474 INFO L272 TraceCheckUtils]: 90: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,474 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8206#true} {8486#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:29,475 INFO L290 TraceCheckUtils]: 95: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:27:29,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:27:29,475 INFO L272 TraceCheckUtils]: 97: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,475 INFO L290 TraceCheckUtils]: 98: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,475 INFO L290 TraceCheckUtils]: 100: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,475 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8206#true} {8508#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:27:29,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,476 INFO L272 TraceCheckUtils]: 104: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,476 INFO L290 TraceCheckUtils]: 105: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,476 INFO L290 TraceCheckUtils]: 106: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,476 INFO L290 TraceCheckUtils]: 107: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,476 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8206#true} {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:29,477 INFO L290 TraceCheckUtils]: 109: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-07 15:27:29,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-07 15:27:29,477 INFO L272 TraceCheckUtils]: 111: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-07 15:27:29,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-07 15:27:29,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-07 15:27:29,477 INFO L290 TraceCheckUtils]: 114: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-07 15:27:29,477 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8206#true} {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-07 15:27:29,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8574#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-07 15:27:29,479 INFO L272 TraceCheckUtils]: 117: Hoare triple {8574#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:29,479 INFO L290 TraceCheckUtils]: 118: Hoare triple {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:29,503 INFO L290 TraceCheckUtils]: 119: Hoare triple {8582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8207#false} is VALID [2022-04-07 15:27:29,503 INFO L290 TraceCheckUtils]: 120: Hoare triple {8207#false} assume !false; {8207#false} is VALID [2022-04-07 15:27:29,504 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-07 15:27:29,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121957617] [2022-04-07 15:27:29,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165109652] [2022-04-07 15:27:29,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165109652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:29,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:29,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-07 15:27:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647578799] [2022-04-07 15:27:29,802 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:29,803 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-07 15:27:29,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:29,803 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-07 15:27:29,861 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-07 15:27:29,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 15:27:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:29,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 15:27:29,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-07 15:27:29,862 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-07 15:27:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:31,789 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-07 15:27:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 15:27:31,789 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-07 15:27:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:31,789 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-07 15:27:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-07 15:27:31,791 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-07 15:27:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-07 15:27:31,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-07 15:27:31,860 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-07 15:27:31,861 INFO L225 Difference]: With dead ends: 78 [2022-04-07 15:27:31,861 INFO L226 Difference]: Without dead ends: 73 [2022-04-07 15:27:31,861 INFO L912 BasicCegarLoop]: 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-07 15:27:31,861 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:31,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 15:27:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-07 15:27:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-07 15:27:31,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:31,904 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-07 15:27:31,904 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-07 15:27:31,904 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-07 15:27:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:31,906 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-07 15:27:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-07 15:27:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:31,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:31,906 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-07 15:27:31,907 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-07 15:27:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:31,908 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-07 15:27:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-07 15:27:31,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:31,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:31,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:31,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:31,909 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-07 15:27:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-07 15:27:31,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-07 15:27:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:31,910 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-07 15:27:31,910 INFO L479 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-07 15:27:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-07 15:27:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-07 15:27:31,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:31,911 INFO L499 BasicCegarLoop]: 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-07 15:27:31,931 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-07 15:27:32,111 WARN L460 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-07 15:27:32,111 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 15 times [2022-04-07 15:27:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:32,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667719645] [2022-04-07 15:27:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:32,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111505163] [2022-04-07 15:27:32,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:27:32,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:32,125 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-07 15:27:32,126 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-07 15:27:32,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-07 15:27:32,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:32,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-07 15:27:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:32,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:33,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {9017#true} call ULTIMATE.init(); {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {9017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9017#true} {9017#true} #60#return; {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {9017#true} call #t~ret5 := main(); {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {9017#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {9017#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9017#true} {9017#true} #52#return; {9017#true} is VALID [2022-04-07 15:27:33,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {9017#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:33,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:33,500 INFO L272 TraceCheckUtils]: 13: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,501 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9017#true} {9055#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:33,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:33,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:33,501 INFO L272 TraceCheckUtils]: 20: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,502 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9017#true} {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:33,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,503 INFO L272 TraceCheckUtils]: 27: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,504 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9017#true} {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-07 15:27:33,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-07 15:27:33,505 INFO L272 TraceCheckUtils]: 34: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,506 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9017#true} {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-07 15:27:33,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,506 INFO L272 TraceCheckUtils]: 41: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,507 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9017#true} {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,508 INFO L272 TraceCheckUtils]: 48: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,509 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9017#true} {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,509 INFO L272 TraceCheckUtils]: 55: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,510 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9017#true} {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,511 INFO L272 TraceCheckUtils]: 62: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,512 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9017#true} {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:27:33,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !false; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:27:33,512 INFO L272 TraceCheckUtils]: 69: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,513 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9017#true} {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} #54#return; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:27:33,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:27:33,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} assume !false; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:27:33,514 INFO L272 TraceCheckUtils]: 76: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,514 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9017#true} {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} #54#return; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:27:33,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !false; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,515 INFO L272 TraceCheckUtils]: 83: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,516 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9017#true} {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} #54#return; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,517 INFO L272 TraceCheckUtils]: 90: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,517 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9017#true} {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:27:33,518 INFO L290 TraceCheckUtils]: 95: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-07 15:27:33,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} assume !false; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-07 15:27:33,518 INFO L272 TraceCheckUtils]: 97: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,518 INFO L290 TraceCheckUtils]: 99: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,518 INFO L290 TraceCheckUtils]: 100: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,519 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9017#true} {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} #54#return; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-07 15:27:33,519 INFO L290 TraceCheckUtils]: 102: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:27:33,520 INFO L290 TraceCheckUtils]: 103: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:27:33,520 INFO L272 TraceCheckUtils]: 104: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,520 INFO L290 TraceCheckUtils]: 105: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,520 INFO L290 TraceCheckUtils]: 106: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,520 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9017#true} {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:27:33,521 INFO L290 TraceCheckUtils]: 109: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:27:33,521 INFO L290 TraceCheckUtils]: 110: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:27:33,521 INFO L272 TraceCheckUtils]: 111: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,521 INFO L290 TraceCheckUtils]: 112: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,521 INFO L290 TraceCheckUtils]: 113: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,521 INFO L290 TraceCheckUtils]: 114: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,522 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9017#true} {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:27:33,522 INFO L290 TraceCheckUtils]: 116: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-07 15:27:33,523 INFO L290 TraceCheckUtils]: 117: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-07 15:27:33,523 INFO L272 TraceCheckUtils]: 118: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-07 15:27:33,523 INFO L290 TraceCheckUtils]: 119: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-07 15:27:33,523 INFO L290 TraceCheckUtils]: 120: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-07 15:27:33,523 INFO L290 TraceCheckUtils]: 121: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-07 15:27:33,523 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9017#true} {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-07 15:27:33,524 INFO L290 TraceCheckUtils]: 123: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-07 15:27:33,525 INFO L272 TraceCheckUtils]: 124: Hoare triple {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:33,525 INFO L290 TraceCheckUtils]: 125: Hoare triple {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:33,525 INFO L290 TraceCheckUtils]: 126: Hoare triple {9415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9018#false} is VALID [2022-04-07 15:27:33,525 INFO L290 TraceCheckUtils]: 127: Hoare triple {9018#false} assume !false; {9018#false} is VALID [2022-04-07 15:27:33,526 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-07 15:27:33,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:35,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667719645] [2022-04-07 15:27:35,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:35,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111505163] [2022-04-07 15:27:35,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111505163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:35,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:35,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-07 15:27:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354933745] [2022-04-07 15:27:35,105 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:35,105 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-07 15:27:35,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:35,106 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-07 15:27:35,173 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-07 15:27:35,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 15:27:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 15:27:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 15:27:35,174 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-07 15:27:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,481 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-07 15:27:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 15:27:37,481 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-07 15:27:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:37,482 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-07 15:27:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-07 15:27:37,483 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-07 15:27:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-07 15:27:37,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-07 15:27:37,547 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-07 15:27:37,550 INFO L225 Difference]: With dead ends: 81 [2022-04-07 15:27:37,550 INFO L226 Difference]: Without dead ends: 76 [2022-04-07 15:27:37,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2022-04-07 15:27:37,551 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:37,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 675 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-07 15:27:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-07 15:27:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-07 15:27:37,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:37,585 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-07 15:27:37,585 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-07 15:27:37,585 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-07 15:27:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,586 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-07 15:27:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-07 15:27:37,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:37,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:37,587 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-07 15:27:37,587 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-07 15:27:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,589 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-07 15:27:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-07 15:27:37,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:37,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:37,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:37,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:37,589 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-07 15:27:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-07 15:27:37,590 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-07 15:27:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:37,591 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-07 15:27:37,591 INFO L479 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-07 15:27:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-07 15:27:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-07 15:27:37,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:37,591 INFO L499 BasicCegarLoop]: 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-07 15:27:37,597 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-07 15:27:37,797 WARN L460 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-07 15:27:37,797 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 16 times [2022-04-07 15:27:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:37,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944620903] [2022-04-07 15:27:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:37,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:37,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023758470] [2022-04-07 15:27:37,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:27:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:37,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:37,809 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-07 15:27:37,817 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-07 15:27:38,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:27:38,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:38,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-07 15:27:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:38,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:39,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {10174#true} call ULTIMATE.init(); {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {10174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10174#true} {10174#true} #60#return; {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {10174#true} call #t~ret5 := main(); {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {10174#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {10174#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10174#true} {10174#true} #52#return; {10174#true} is VALID [2022-04-07 15:27:39,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {10174#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:39,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:39,031 INFO L272 TraceCheckUtils]: 13: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,032 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10174#true} {10212#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:39,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:39,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:39,033 INFO L272 TraceCheckUtils]: 20: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,033 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10174#true} {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:39,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:39,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:39,034 INFO L272 TraceCheckUtils]: 27: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,035 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10174#true} {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:39,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:39,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:39,036 INFO L272 TraceCheckUtils]: 34: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,036 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10174#true} {10278#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:39,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,037 INFO L272 TraceCheckUtils]: 41: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,038 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10174#true} {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:39,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:39,038 INFO L272 TraceCheckUtils]: 48: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,039 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10174#true} {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:39,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-07 15:27:39,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !false; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-07 15:27:39,040 INFO L272 TraceCheckUtils]: 55: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,040 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10174#true} {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} #54#return; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-07 15:27:39,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-07 15:27:39,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-07 15:27:39,041 INFO L272 TraceCheckUtils]: 62: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,042 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10174#true} {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-07 15:27:39,042 INFO L290 TraceCheckUtils]: 67: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:27:39,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:27:39,042 INFO L272 TraceCheckUtils]: 69: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,043 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10174#true} {10388#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:27:39,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:27:39,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:27:39,044 INFO L272 TraceCheckUtils]: 76: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,044 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10174#true} {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:27:39,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-07 15:27:39,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-07 15:27:39,045 INFO L272 TraceCheckUtils]: 83: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,046 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10174#true} {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-07 15:27:39,046 INFO L290 TraceCheckUtils]: 88: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:39,046 INFO L290 TraceCheckUtils]: 89: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:39,047 INFO L272 TraceCheckUtils]: 90: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,047 INFO L290 TraceCheckUtils]: 91: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,047 INFO L290 TraceCheckUtils]: 93: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,047 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10174#true} {10454#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:27:39,047 INFO L290 TraceCheckUtils]: 95: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:27:39,048 INFO L290 TraceCheckUtils]: 96: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:27:39,048 INFO L272 TraceCheckUtils]: 97: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,048 INFO L290 TraceCheckUtils]: 99: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,048 INFO L290 TraceCheckUtils]: 100: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,048 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10174#true} {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:27:39,049 INFO L290 TraceCheckUtils]: 102: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:27:39,049 INFO L290 TraceCheckUtils]: 103: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:27:39,049 INFO L272 TraceCheckUtils]: 104: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,049 INFO L290 TraceCheckUtils]: 105: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,049 INFO L290 TraceCheckUtils]: 106: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,049 INFO L290 TraceCheckUtils]: 107: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,050 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10174#true} {10498#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:27:39,050 INFO L290 TraceCheckUtils]: 109: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:27:39,050 INFO L290 TraceCheckUtils]: 110: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:27:39,051 INFO L272 TraceCheckUtils]: 111: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,051 INFO L290 TraceCheckUtils]: 112: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-07 15:27:39,051 INFO L290 TraceCheckUtils]: 113: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-07 15:27:39,051 INFO L290 TraceCheckUtils]: 114: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-07 15:27:39,051 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10174#true} {10520#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:27:39,052 INFO L290 TraceCheckUtils]: 116: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,052 INFO L290 TraceCheckUtils]: 117: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,052 INFO L272 TraceCheckUtils]: 118: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,052 INFO L290 TraceCheckUtils]: 119: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:39,052 INFO L290 TraceCheckUtils]: 120: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:27:39,053 INFO L290 TraceCheckUtils]: 121: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:27:39,053 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:39,054 INFO L290 TraceCheckUtils]: 123: Hoare triple {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-07 15:27:39,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-07 15:27:39,054 INFO L272 TraceCheckUtils]: 125: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-07 15:27:39,055 INFO L290 TraceCheckUtils]: 126: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:39,055 INFO L290 TraceCheckUtils]: 127: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:27:39,055 INFO L290 TraceCheckUtils]: 128: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:27:39,056 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-07 15:27:39,057 INFO L290 TraceCheckUtils]: 130: Hoare triple {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10590#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-07 15:27:39,058 INFO L272 TraceCheckUtils]: 131: Hoare triple {10590#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:39,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:39,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {10598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10175#false} is VALID [2022-04-07 15:27:39,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {10175#false} assume !false; {10175#false} is VALID [2022-04-07 15:27:39,059 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-07 15:27:39,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:20,945 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-07 15:28:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944620903] [2022-04-07 15:28:20,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023758470] [2022-04-07 15:28:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023758470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:20,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-07 15:28:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083337911] [2022-04-07 15:28:20,949 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:20,949 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-07 15:28:20,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:20,950 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-07 15:28:21,025 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-07 15:28:21,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 15:28:21,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 15:28:21,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=830, Unknown=7, NotChecked=58, Total=992 [2022-04-07 15:28:21,026 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-07 15:28:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:23,953 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-07 15:28:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-07 15:28:23,953 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-07 15:28:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:23,953 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-07 15:28:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-07 15:28:23,955 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-07 15:28:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-07 15:28:23,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 96 transitions. [2022-04-07 15:28:24,040 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-07 15:28:24,042 INFO L225 Difference]: With dead ends: 84 [2022-04-07 15:28:24,042 INFO L226 Difference]: Without dead ends: 79 [2022-04-07 15:28:24,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=118, Invalid=1001, Unknown=7, NotChecked=64, Total=1190 [2022-04-07 15:28:24,042 INFO L913 BasicCegarLoop]: 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-07 15:28:24,043 INFO L914 BasicCegarLoop]: 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-07 15:28:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-07 15:28:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-07 15:28:24,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:24,095 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-07 15:28:24,095 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-07 15:28:24,095 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-07 15:28:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:24,096 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-07 15:28:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-07 15:28:24,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:24,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:24,097 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-07 15:28:24,097 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-07 15:28:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:24,098 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-07 15:28:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-07 15:28:24,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:24,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:24,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:24,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:24,099 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-07 15:28:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-07 15:28:24,100 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-07 15:28:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:24,100 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-07 15:28:24,100 INFO L479 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-07 15:28:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-07 15:28:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-07 15:28:24,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:24,101 INFO L499 BasicCegarLoop]: 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-07 15:28:24,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-07 15:28:24,301 WARN L460 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-07 15:28:24,302 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 17 times [2022-04-07 15:28:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597572290] [2022-04-07 15:28:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:24,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:24,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995433559] [2022-04-07 15:28:24,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 15:28:24,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:24,325 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-07 15:28:24,326 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-07 15:28:25,463 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-04-07 15:28:25,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:28:25,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-07 15:28:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:25,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:28:26,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2022-04-07 15:28:26,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {11070#true} is VALID [2022-04-07 15:28:26,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #60#return; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret5 := main(); {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {11070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11070#true} {11070#true} #52#return; {11070#true} is VALID [2022-04-07 15:28:26,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {11070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:26,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:26,253 INFO L272 TraceCheckUtils]: 13: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,253 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11070#true} {11108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:26,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:28:26,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:28:26,254 INFO L272 TraceCheckUtils]: 20: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,255 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11070#true} {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:28:26,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:26,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:26,256 INFO L272 TraceCheckUtils]: 27: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,256 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11070#true} {11152#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:26,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-07 15:28:26,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-07 15:28:26,257 INFO L272 TraceCheckUtils]: 34: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,258 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11070#true} {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-07 15:28:26,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-07 15:28:26,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-07 15:28:26,258 INFO L272 TraceCheckUtils]: 41: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,259 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11070#true} {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-07 15:28:26,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:26,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:26,260 INFO L272 TraceCheckUtils]: 48: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,260 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11070#true} {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:26,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:26,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:26,261 INFO L272 TraceCheckUtils]: 55: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,262 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11070#true} {11240#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:26,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:26,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:26,262 INFO L272 TraceCheckUtils]: 62: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,263 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11070#true} {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:26,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-07 15:28:26,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-07 15:28:26,264 INFO L272 TraceCheckUtils]: 69: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,265 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11070#true} {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-07 15:28:26,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:26,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:26,265 INFO L272 TraceCheckUtils]: 76: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,266 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11070#true} {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #54#return; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:26,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:28:26,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !false; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:28:26,267 INFO L272 TraceCheckUtils]: 83: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,267 INFO L290 TraceCheckUtils]: 84: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,267 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11070#true} {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} #54#return; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:28:26,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:26,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !false; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:26,268 INFO L272 TraceCheckUtils]: 90: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,268 INFO L290 TraceCheckUtils]: 91: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,268 INFO L290 TraceCheckUtils]: 92: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,268 INFO L290 TraceCheckUtils]: 93: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,269 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11070#true} {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} #54#return; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:26,269 INFO L290 TraceCheckUtils]: 95: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-07 15:28:26,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} assume !false; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-07 15:28:26,270 INFO L272 TraceCheckUtils]: 97: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,270 INFO L290 TraceCheckUtils]: 98: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,270 INFO L290 TraceCheckUtils]: 99: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,270 INFO L290 TraceCheckUtils]: 100: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,270 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11070#true} {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} #54#return; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-07 15:28:26,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-07 15:28:26,271 INFO L290 TraceCheckUtils]: 103: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} assume !false; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-07 15:28:26,271 INFO L272 TraceCheckUtils]: 104: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,271 INFO L290 TraceCheckUtils]: 105: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,271 INFO L290 TraceCheckUtils]: 106: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,271 INFO L290 TraceCheckUtils]: 107: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,272 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11070#true} {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} #54#return; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-07 15:28:26,272 INFO L290 TraceCheckUtils]: 109: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:28:26,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !false; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:28:26,272 INFO L272 TraceCheckUtils]: 111: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,273 INFO L290 TraceCheckUtils]: 112: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,273 INFO L290 TraceCheckUtils]: 113: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,273 INFO L290 TraceCheckUtils]: 114: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,273 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11070#true} {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} #54#return; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:28:26,273 INFO L290 TraceCheckUtils]: 116: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-07 15:28:26,274 INFO L290 TraceCheckUtils]: 117: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} assume !false; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-07 15:28:26,274 INFO L272 TraceCheckUtils]: 118: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,274 INFO L290 TraceCheckUtils]: 119: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,274 INFO L290 TraceCheckUtils]: 120: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,274 INFO L290 TraceCheckUtils]: 121: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,274 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11070#true} {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} #54#return; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-07 15:28:26,275 INFO L290 TraceCheckUtils]: 123: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-07 15:28:26,275 INFO L290 TraceCheckUtils]: 124: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} assume !false; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-07 15:28:26,275 INFO L272 TraceCheckUtils]: 125: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,275 INFO L290 TraceCheckUtils]: 126: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,275 INFO L290 TraceCheckUtils]: 127: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,275 INFO L290 TraceCheckUtils]: 128: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,276 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11070#true} {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} #54#return; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-07 15:28:26,276 INFO L290 TraceCheckUtils]: 130: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:28:26,277 INFO L290 TraceCheckUtils]: 131: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:28:26,277 INFO L272 TraceCheckUtils]: 132: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-07 15:28:26,277 INFO L290 TraceCheckUtils]: 133: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-07 15:28:26,277 INFO L290 TraceCheckUtils]: 134: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-07 15:28:26,277 INFO L290 TraceCheckUtils]: 135: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-07 15:28:26,277 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11070#true} {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:28:26,279 INFO L290 TraceCheckUtils]: 137: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:28:26,279 INFO L272 TraceCheckUtils]: 138: Hoare triple {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:28:26,279 INFO L290 TraceCheckUtils]: 139: Hoare triple {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:28:26,280 INFO L290 TraceCheckUtils]: 140: Hoare triple {11512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11071#false} is VALID [2022-04-07 15:28:26,280 INFO L290 TraceCheckUtils]: 141: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-07 15:28:26,280 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-07 15:28:26,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597572290] [2022-04-07 15:28:26,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995433559] [2022-04-07 15:28:26,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995433559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:26,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:26,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-07 15:28:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096681480] [2022-04-07 15:28:26,530 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:26,531 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-07 15:28:26,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:26,531 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-07 15:28:26,588 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-07 15:28:26,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-07 15:28:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:26,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-07 15:28:26,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-07 15:28:26,588 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-07 15:28:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:29,048 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-07 15:28:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-07 15:28:29,048 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-07 15:28:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:29,048 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-07 15:28:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-07 15:28:29,050 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-07 15:28:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-07 15:28:29,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-07 15:28:29,130 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-07 15:28:29,132 INFO L225 Difference]: With dead ends: 87 [2022-04-07 15:28:29,132 INFO L226 Difference]: Without dead ends: 82 [2022-04-07 15:28:29,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-07 15:28:29,133 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-07 15:28:29,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-07 15:28:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-07 15:28:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-07 15:28:29,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:29,189 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-07 15:28:29,193 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-07 15:28:29,194 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-07 15:28:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:29,208 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-07 15:28:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-07 15:28:29,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:29,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:29,208 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-07 15:28:29,208 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-07 15:28:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:29,210 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-07 15:28:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-07 15:28:29,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:29,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:29,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:29,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:29,211 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-07 15:28:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-07 15:28:29,227 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-07 15:28:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:29,227 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-07 15:28:29,228 INFO L479 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-07 15:28:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-07 15:28:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-07 15:28:29,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:29,228 INFO L499 BasicCegarLoop]: 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-07 15:28:29,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-07 15:28:29,429 WARN L460 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-07 15:28:29,429 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 18 times [2022-04-07 15:28:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:29,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451745935] [2022-04-07 15:28:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:29,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:29,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233598038] [2022-04-07 15:28:29,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 15:28:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:29,447 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-07 15:28:29,448 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-07 15:28:32,359 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-07 15:28:32,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:28:32,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-07 15:28:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:32,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:28:33,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {11995#true} call ULTIMATE.init(); {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {11995#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11995#true} {11995#true} #60#return; {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {11995#true} call #t~ret5 := main(); {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {11995#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {11995#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11995#true} {11995#true} #52#return; {11995#true} is VALID [2022-04-07 15:28:33,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {11995#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:33,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:33,360 INFO L272 TraceCheckUtils]: 13: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,361 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11995#true} {12033#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:33,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:33,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:33,362 INFO L272 TraceCheckUtils]: 20: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,362 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11995#true} {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:33,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:28:33,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:28:33,363 INFO L272 TraceCheckUtils]: 27: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,364 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11995#true} {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:28:33,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:28:33,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:28:33,364 INFO L272 TraceCheckUtils]: 34: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,365 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11995#true} {12099#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:28:33,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:28:33,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:28:33,366 INFO L272 TraceCheckUtils]: 41: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,366 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11995#true} {12121#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:28:33,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:33,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:33,367 INFO L272 TraceCheckUtils]: 48: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,368 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11995#true} {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:33,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,369 INFO L272 TraceCheckUtils]: 55: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,369 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11995#true} {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:33,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:33,370 INFO L272 TraceCheckUtils]: 62: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,371 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11995#true} {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:33,371 INFO L290 TraceCheckUtils]: 67: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:28:33,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:28:33,371 INFO L272 TraceCheckUtils]: 69: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,371 INFO L290 TraceCheckUtils]: 70: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,372 INFO L290 TraceCheckUtils]: 72: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,372 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11995#true} {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:28:33,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:28:33,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:28:33,374 INFO L272 TraceCheckUtils]: 76: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,374 INFO L290 TraceCheckUtils]: 79: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,375 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11995#true} {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} #54#return; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:28:33,375 INFO L290 TraceCheckUtils]: 81: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-07 15:28:33,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} assume !false; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-07 15:28:33,376 INFO L272 TraceCheckUtils]: 83: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,376 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11995#true} {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} #54#return; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} is VALID [2022-04-07 15:28:33,377 INFO L290 TraceCheckUtils]: 88: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10) (< main_~c~0 (+ main_~k~0 3)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-07 15:28:33,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !false; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-07 15:28:33,378 INFO L272 TraceCheckUtils]: 90: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,378 INFO L290 TraceCheckUtils]: 93: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,378 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11995#true} {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} #54#return; {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-07 15:28:33,379 INFO L290 TraceCheckUtils]: 95: Hoare triple {12275#(and (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-07 15:28:33,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} assume !false; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-07 15:28:33,379 INFO L272 TraceCheckUtils]: 97: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,380 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11995#true} {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} #54#return; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} is VALID [2022-04-07 15:28:33,380 INFO L290 TraceCheckUtils]: 102: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))) (< main_~c~0 (+ 5 main_~k~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,381 INFO L272 TraceCheckUtils]: 104: Hoare triple {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,381 INFO L290 TraceCheckUtils]: 105: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,381 INFO L290 TraceCheckUtils]: 106: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,381 INFO L290 TraceCheckUtils]: 107: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,381 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11995#true} {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,382 INFO L290 TraceCheckUtils]: 109: Hoare triple {12319#(and (< 7 main_~k~0) (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:33,382 INFO L290 TraceCheckUtils]: 110: Hoare triple {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} assume !false; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:33,382 INFO L272 TraceCheckUtils]: 111: Hoare triple {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,383 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11995#true} {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} #54#return; {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:33,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {12341#(and (< 7 main_~k~0) (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-07 15:28:33,384 INFO L290 TraceCheckUtils]: 117: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-07 15:28:33,384 INFO L272 TraceCheckUtils]: 118: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,384 INFO L290 TraceCheckUtils]: 119: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,384 INFO L290 TraceCheckUtils]: 120: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,384 INFO L290 TraceCheckUtils]: 121: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,384 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11995#true} {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-07 15:28:33,385 INFO L290 TraceCheckUtils]: 123: Hoare triple {12363#(and (< 7 main_~k~0) (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,385 INFO L290 TraceCheckUtils]: 124: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,385 INFO L272 TraceCheckUtils]: 125: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,385 INFO L290 TraceCheckUtils]: 126: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,385 INFO L290 TraceCheckUtils]: 127: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,385 INFO L290 TraceCheckUtils]: 128: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,386 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11995#true} {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:33,386 INFO L290 TraceCheckUtils]: 130: Hoare triple {12385#(and (< 7 main_~k~0) (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-07 15:28:33,387 INFO L290 TraceCheckUtils]: 131: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} assume !false; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-07 15:28:33,387 INFO L272 TraceCheckUtils]: 132: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,387 INFO L290 TraceCheckUtils]: 133: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,387 INFO L290 TraceCheckUtils]: 134: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,387 INFO L290 TraceCheckUtils]: 135: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,388 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11995#true} {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} #54#return; {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-07 15:28:33,388 INFO L290 TraceCheckUtils]: 137: Hoare triple {12407#(and (< 7 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:33,388 INFO L290 TraceCheckUtils]: 138: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:33,388 INFO L272 TraceCheckUtils]: 139: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-07 15:28:33,388 INFO L290 TraceCheckUtils]: 140: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-07 15:28:33,388 INFO L290 TraceCheckUtils]: 141: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-07 15:28:33,389 INFO L290 TraceCheckUtils]: 142: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-07 15:28:33,389 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {11995#true} {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:33,390 INFO L290 TraceCheckUtils]: 144: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:33,391 INFO L272 TraceCheckUtils]: 145: Hoare triple {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:28:33,391 INFO L290 TraceCheckUtils]: 146: Hoare triple {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:28:33,391 INFO L290 TraceCheckUtils]: 147: Hoare triple {12459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11996#false} is VALID [2022-04-07 15:28:33,391 INFO L290 TraceCheckUtils]: 148: Hoare triple {11996#false} assume !false; {11996#false} is VALID [2022-04-07 15:28:33,392 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-07 15:28:33,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:34,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:34,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451745935] [2022-04-07 15:28:34,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:34,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233598038] [2022-04-07 15:28:34,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233598038] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:34,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:34,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-07 15:28:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203715047] [2022-04-07 15:28:34,843 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:34,843 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-07 15:28:34,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:34,844 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-07 15:28:34,935 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-07 15:28:34,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 15:28:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 15:28:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 15:28:34,937 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-07 15:28:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:38,515 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-07 15:28:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 15:28:38,515 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-07 15:28:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:38,516 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-07 15:28:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-07 15:28:38,518 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-07 15:28:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-07 15:28:38,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-07 15:28:38,620 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-07 15:28:38,621 INFO L225 Difference]: With dead ends: 90 [2022-04-07 15:28:38,621 INFO L226 Difference]: Without dead ends: 85 [2022-04-07 15:28:38,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2022-04-07 15:28:38,622 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-07 15:28:38,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 853 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-07 15:28:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-07 15:28:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-07 15:28:38,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:38,686 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-07 15:28:38,686 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-07 15:28:38,686 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-07 15:28:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:38,688 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-07 15:28:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-07 15:28:38,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:38,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:38,689 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-07 15:28:38,689 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-07 15:28:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:38,691 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-07 15:28:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-07 15:28:38,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:38,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:38,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:38,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:38,691 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-07 15:28:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-07 15:28:38,693 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-07 15:28:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:38,693 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-07 15:28:38,693 INFO L479 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-07 15:28:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-07 15:28:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-07 15:28:38,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:38,694 INFO L499 BasicCegarLoop]: 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-07 15:28:38,700 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-07 15:28:38,900 WARN L460 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-07 15:28:38,900 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 19 times [2022-04-07 15:28:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718982865] [2022-04-07 15:28:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:38,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:38,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545321650] [2022-04-07 15:28:38,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 15:28:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:38,919 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-07 15:28:38,920 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-07 15:28:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:39,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-07 15:28:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:39,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:28:40,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {13178#true} call ULTIMATE.init(); {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {13178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13178#true} {13178#true} #60#return; {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {13178#true} call #t~ret5 := main(); {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {13178#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {13178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13178#true} {13178#true} #52#return; {13178#true} is VALID [2022-04-07 15:28:40,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {13178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:40,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {13216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:40,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {13216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,411 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13178#true} {13216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:40,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {13216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:28:40,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {13238#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:28:40,411 INFO L272 TraceCheckUtils]: 20: Hoare triple {13238#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,412 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13178#true} {13238#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {13238#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:28:40,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {13238#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:40,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {13260#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:40,413 INFO L272 TraceCheckUtils]: 27: Hoare triple {13260#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,413 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13178#true} {13260#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {13260#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:40,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {13260#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:40,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:40,414 INFO L272 TraceCheckUtils]: 34: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,415 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13178#true} {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:40,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {13282#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:28:40,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:28:40,415 INFO L272 TraceCheckUtils]: 41: Hoare triple {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,416 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13178#true} {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-07 15:28:40,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {13304#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:40,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:40,417 INFO L272 TraceCheckUtils]: 48: Hoare triple {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,417 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13178#true} {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:40,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {13326#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,418 INFO L272 TraceCheckUtils]: 55: Hoare triple {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,419 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13178#true} {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {13348#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:40,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:40,420 INFO L272 TraceCheckUtils]: 62: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,420 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13178#true} {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:40,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {13370#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:28:40,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {13392#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:28:40,421 INFO L272 TraceCheckUtils]: 69: Hoare triple {13392#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,422 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13178#true} {13392#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {13392#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-07 15:28:40,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {13392#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:28:40,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:28:40,422 INFO L272 TraceCheckUtils]: 76: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,422 INFO L290 TraceCheckUtils]: 77: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,423 INFO L290 TraceCheckUtils]: 79: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,423 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13178#true} {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:28:40,423 INFO L290 TraceCheckUtils]: 81: Hoare triple {13414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:40,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:40,424 INFO L272 TraceCheckUtils]: 83: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,424 INFO L290 TraceCheckUtils]: 84: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,424 INFO L290 TraceCheckUtils]: 85: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,424 INFO L290 TraceCheckUtils]: 86: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,424 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13178#true} {13436#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {13436#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:40,425 INFO L290 TraceCheckUtils]: 88: Hoare triple {13436#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:40,425 INFO L290 TraceCheckUtils]: 89: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:40,425 INFO L272 TraceCheckUtils]: 90: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,426 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13178#true} {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:40,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {13458#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:40,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {13480#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:40,427 INFO L272 TraceCheckUtils]: 97: Hoare triple {13480#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,427 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13178#true} {13480#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13480#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:40,427 INFO L290 TraceCheckUtils]: 102: Hoare triple {13480#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,428 INFO L290 TraceCheckUtils]: 103: Hoare triple {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,428 INFO L272 TraceCheckUtils]: 104: Hoare triple {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,428 INFO L290 TraceCheckUtils]: 105: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,428 INFO L290 TraceCheckUtils]: 106: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,428 INFO L290 TraceCheckUtils]: 107: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,428 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13178#true} {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:40,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {13502#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:28:40,429 INFO L290 TraceCheckUtils]: 110: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:28:40,429 INFO L272 TraceCheckUtils]: 111: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,429 INFO L290 TraceCheckUtils]: 114: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,430 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13178#true} {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:28:40,430 INFO L290 TraceCheckUtils]: 116: Hoare triple {13524#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:28:40,431 INFO L290 TraceCheckUtils]: 117: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:28:40,431 INFO L272 TraceCheckUtils]: 118: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,431 INFO L290 TraceCheckUtils]: 119: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,431 INFO L290 TraceCheckUtils]: 120: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,431 INFO L290 TraceCheckUtils]: 121: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,431 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13178#true} {13546#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {13546#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:28:40,432 INFO L290 TraceCheckUtils]: 123: Hoare triple {13546#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-07 15:28:40,432 INFO L290 TraceCheckUtils]: 124: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-07 15:28:40,432 INFO L272 TraceCheckUtils]: 125: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,432 INFO L290 TraceCheckUtils]: 126: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,432 INFO L290 TraceCheckUtils]: 127: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,432 INFO L290 TraceCheckUtils]: 128: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,433 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13178#true} {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #54#return; {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-07 15:28:40,433 INFO L290 TraceCheckUtils]: 130: Hoare triple {13568#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:40,433 INFO L290 TraceCheckUtils]: 131: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !false; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:40,433 INFO L272 TraceCheckUtils]: 132: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,433 INFO L290 TraceCheckUtils]: 133: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,434 INFO L290 TraceCheckUtils]: 134: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,434 INFO L290 TraceCheckUtils]: 135: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,434 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13178#true} {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} #54#return; {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:40,434 INFO L290 TraceCheckUtils]: 137: Hoare triple {13590#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:40,435 INFO L290 TraceCheckUtils]: 138: Hoare triple {13612#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:40,435 INFO L272 TraceCheckUtils]: 139: Hoare triple {13612#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,435 INFO L290 TraceCheckUtils]: 140: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,435 INFO L290 TraceCheckUtils]: 141: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,435 INFO L290 TraceCheckUtils]: 142: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,435 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13178#true} {13612#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {13612#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-07 15:28:40,436 INFO L290 TraceCheckUtils]: 144: Hoare triple {13612#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-07 15:28:40,436 INFO L290 TraceCheckUtils]: 145: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !false; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-07 15:28:40,436 INFO L272 TraceCheckUtils]: 146: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13178#true} is VALID [2022-04-07 15:28:40,436 INFO L290 TraceCheckUtils]: 147: Hoare triple {13178#true} ~cond := #in~cond; {13178#true} is VALID [2022-04-07 15:28:40,436 INFO L290 TraceCheckUtils]: 148: Hoare triple {13178#true} assume !(0 == ~cond); {13178#true} is VALID [2022-04-07 15:28:40,436 INFO L290 TraceCheckUtils]: 149: Hoare triple {13178#true} assume true; {13178#true} is VALID [2022-04-07 15:28:40,437 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13178#true} {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} #54#return; {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} is VALID [2022-04-07 15:28:40,437 INFO L290 TraceCheckUtils]: 151: Hoare triple {13634#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {13656#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~k~0 19))} is VALID [2022-04-07 15:28:40,438 INFO L272 TraceCheckUtils]: 152: Hoare triple {13656#(and (< 18 main_~k~0) (= 18 (+ (- 1) main_~y~0)) (<= main_~k~0 19))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:28:40,438 INFO L290 TraceCheckUtils]: 153: Hoare triple {13660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:28:40,438 INFO L290 TraceCheckUtils]: 154: Hoare triple {13664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13179#false} is VALID [2022-04-07 15:28:40,439 INFO L290 TraceCheckUtils]: 155: Hoare triple {13179#false} assume !false; {13179#false} is VALID [2022-04-07 15:28:40,439 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-07 15:28:40,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:40,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718982865] [2022-04-07 15:28:40,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545321650] [2022-04-07 15:28:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545321650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:40,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-07 15:28:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868570388] [2022-04-07 15:28:40,769 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:40,769 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-07 15:28:40,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:40,769 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-07 15:28:40,859 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-07 15:28:40,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-07 15:28:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-07 15:28:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-07 15:28:40,860 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-07 15:28:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:44,565 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-07 15:28:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-07 15:28:44,565 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-07 15:28:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:44,566 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-07 15:28:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-07 15:28:44,581 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-07 15:28:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-07 15:28:44,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-07 15:28:44,661 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-07 15:28:44,663 INFO L225 Difference]: With dead ends: 93 [2022-04-07 15:28:44,663 INFO L226 Difference]: Without dead ends: 88 [2022-04-07 15:28:44,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-07 15:28:44,663 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-07 15:28:44,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 925 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-07 15:28:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-07 15:28:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-07 15:28:44,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:44,706 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-07 15:28:44,707 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-07 15:28:44,707 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-07 15:28:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:44,709 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-07 15:28:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-07 15:28:44,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:44,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:44,709 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-07 15:28:44,709 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-07 15:28:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:44,711 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-07 15:28:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-07 15:28:44,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:44,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:44,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:44,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:44,712 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-07 15:28:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-07 15:28:44,715 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-07 15:28:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:44,715 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-07 15:28:44,715 INFO L479 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-07 15:28:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-07 15:28:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-07 15:28:44,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:44,717 INFO L499 BasicCegarLoop]: 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-07 15:28:44,738 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-07 15:28:44,936 WARN L460 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-07 15:28:44,936 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 20 times [2022-04-07 15:28:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621377650] [2022-04-07 15:28:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:44,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:44,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662250192] [2022-04-07 15:28:44,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:28:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:44,956 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-07 15:28:44,980 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-07 15:28:45,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:28:45,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:28:45,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-07 15:28:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:45,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:28:46,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {14179#true} call ULTIMATE.init(); {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {14179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14179#true} {14179#true} #60#return; {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {14179#true} call #t~ret5 := main(); {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {14179#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {14179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14179#true} {14179#true} #52#return; {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {14179#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {14217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:46,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {14217#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,354 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14179#true} {14217#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {14217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:46,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {14217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:28:46,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:28:46,355 INFO L272 TraceCheckUtils]: 20: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,355 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14179#true} {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:28:46,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:46,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {14261#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:46,356 INFO L272 TraceCheckUtils]: 27: Hoare triple {14261#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,357 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14179#true} {14261#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {14261#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:28:46,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {14261#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:46,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:46,357 INFO L272 TraceCheckUtils]: 34: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,358 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14179#true} {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:28:46,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {14283#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:28:46,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:28:46,359 INFO L272 TraceCheckUtils]: 41: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,359 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14179#true} {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:28:46,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {14305#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:28:46,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:28:46,360 INFO L272 TraceCheckUtils]: 48: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,361 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14179#true} {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:28:46,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {14327#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:46,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {14349#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:46,361 INFO L272 TraceCheckUtils]: 55: Hoare triple {14349#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,362 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14179#true} {14349#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {14349#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:46,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {14349#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:46,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:46,363 INFO L272 TraceCheckUtils]: 62: Hoare triple {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,363 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14179#true} {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:28:46,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {14371#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-07 15:28:46,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-07 15:28:46,364 INFO L272 TraceCheckUtils]: 69: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,365 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14179#true} {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-07 15:28:46,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {14393#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,365 INFO L290 TraceCheckUtils]: 75: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,365 INFO L272 TraceCheckUtils]: 76: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,366 INFO L290 TraceCheckUtils]: 78: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,366 INFO L290 TraceCheckUtils]: 79: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,366 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14179#true} {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #54#return; {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,366 INFO L290 TraceCheckUtils]: 81: Hoare triple {14415#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:46,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:46,367 INFO L272 TraceCheckUtils]: 83: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,367 INFO L290 TraceCheckUtils]: 84: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,367 INFO L290 TraceCheckUtils]: 85: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,367 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14179#true} {14437#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {14437#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:28:46,368 INFO L290 TraceCheckUtils]: 88: Hoare triple {14437#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:28:46,368 INFO L290 TraceCheckUtils]: 89: Hoare triple {14459#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:28:46,368 INFO L272 TraceCheckUtils]: 90: Hoare triple {14459#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,369 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {14179#true} {14459#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {14459#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-07 15:28:46,369 INFO L290 TraceCheckUtils]: 95: Hoare triple {14459#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:46,369 INFO L290 TraceCheckUtils]: 96: Hoare triple {14481#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:46,369 INFO L272 TraceCheckUtils]: 97: Hoare triple {14481#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,369 INFO L290 TraceCheckUtils]: 98: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,370 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14179#true} {14481#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {14481#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:28:46,370 INFO L290 TraceCheckUtils]: 102: Hoare triple {14481#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:28:46,371 INFO L290 TraceCheckUtils]: 103: Hoare triple {14503#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:28:46,371 INFO L272 TraceCheckUtils]: 104: Hoare triple {14503#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,371 INFO L290 TraceCheckUtils]: 106: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,371 INFO L290 TraceCheckUtils]: 107: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,371 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14179#true} {14503#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {14503#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:28:46,372 INFO L290 TraceCheckUtils]: 109: Hoare triple {14503#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:46,372 INFO L290 TraceCheckUtils]: 110: Hoare triple {14525#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:46,372 INFO L272 TraceCheckUtils]: 111: Hoare triple {14525#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,372 INFO L290 TraceCheckUtils]: 112: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,372 INFO L290 TraceCheckUtils]: 113: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,372 INFO L290 TraceCheckUtils]: 114: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,373 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {14179#true} {14525#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {14525#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:28:46,373 INFO L290 TraceCheckUtils]: 116: Hoare triple {14525#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,373 INFO L290 TraceCheckUtils]: 117: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,373 INFO L272 TraceCheckUtils]: 118: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,374 INFO L290 TraceCheckUtils]: 119: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,374 INFO L290 TraceCheckUtils]: 120: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,374 INFO L290 TraceCheckUtils]: 121: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,374 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14179#true} {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:46,374 INFO L290 TraceCheckUtils]: 123: Hoare triple {14547#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:28:46,375 INFO L290 TraceCheckUtils]: 124: Hoare triple {14569#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:28:46,375 INFO L272 TraceCheckUtils]: 125: Hoare triple {14569#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,375 INFO L290 TraceCheckUtils]: 126: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,375 INFO L290 TraceCheckUtils]: 127: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,375 INFO L290 TraceCheckUtils]: 128: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,375 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14179#true} {14569#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {14569#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:28:46,376 INFO L290 TraceCheckUtils]: 130: Hoare triple {14569#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-07 15:28:46,376 INFO L290 TraceCheckUtils]: 131: Hoare triple {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-07 15:28:46,376 INFO L272 TraceCheckUtils]: 132: Hoare triple {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,376 INFO L290 TraceCheckUtils]: 133: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,376 INFO L290 TraceCheckUtils]: 134: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,376 INFO L290 TraceCheckUtils]: 135: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,377 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {14179#true} {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-07 15:28:46,377 INFO L290 TraceCheckUtils]: 137: Hoare triple {14591#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:28:46,377 INFO L290 TraceCheckUtils]: 138: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:28:46,378 INFO L272 TraceCheckUtils]: 139: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,378 INFO L290 TraceCheckUtils]: 140: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,378 INFO L290 TraceCheckUtils]: 141: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,378 INFO L290 TraceCheckUtils]: 142: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,378 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {14179#true} {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:28:46,379 INFO L290 TraceCheckUtils]: 144: Hoare triple {14613#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-07 15:28:46,379 INFO L290 TraceCheckUtils]: 145: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-07 15:28:46,379 INFO L272 TraceCheckUtils]: 146: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,379 INFO L290 TraceCheckUtils]: 147: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,379 INFO L290 TraceCheckUtils]: 148: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,379 INFO L290 TraceCheckUtils]: 149: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,380 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {14179#true} {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #54#return; {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-07 15:28:46,380 INFO L290 TraceCheckUtils]: 151: Hoare triple {14635#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-07 15:28:46,380 INFO L290 TraceCheckUtils]: 152: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} assume !false; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-07 15:28:46,380 INFO L272 TraceCheckUtils]: 153: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14179#true} is VALID [2022-04-07 15:28:46,380 INFO L290 TraceCheckUtils]: 154: Hoare triple {14179#true} ~cond := #in~cond; {14179#true} is VALID [2022-04-07 15:28:46,380 INFO L290 TraceCheckUtils]: 155: Hoare triple {14179#true} assume !(0 == ~cond); {14179#true} is VALID [2022-04-07 15:28:46,380 INFO L290 TraceCheckUtils]: 156: Hoare triple {14179#true} assume true; {14179#true} is VALID [2022-04-07 15:28:46,381 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {14179#true} {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} #54#return; {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-07 15:28:46,382 INFO L290 TraceCheckUtils]: 158: Hoare triple {14657#(and (<= main_~c~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {14679#(and (<= main_~k~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} is VALID [2022-04-07 15:28:46,382 INFO L272 TraceCheckUtils]: 159: Hoare triple {14679#(and (<= main_~k~0 20) (= (+ (- 2) main_~y~0) 18) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:28:46,383 INFO L290 TraceCheckUtils]: 160: Hoare triple {14683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:28:46,383 INFO L290 TraceCheckUtils]: 161: Hoare triple {14687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14180#false} is VALID [2022-04-07 15:28:46,383 INFO L290 TraceCheckUtils]: 162: Hoare triple {14180#false} assume !false; {14180#false} is VALID [2022-04-07 15:28:46,384 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-07 15:28:46,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:46,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:46,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621377650] [2022-04-07 15:28:46,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:46,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662250192] [2022-04-07 15:28:46,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662250192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:46,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:46,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-07 15:28:46,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251826683] [2022-04-07 15:28:46,706 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:46,706 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-07 15:28:46,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:46,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-07 15:28:46,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:28:46,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 15:28:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 15:28:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-07 15:28:46,828 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-07 15:28:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:51,195 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-07 15:28:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-07 15:28:51,196 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-07 15:28:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-07 15:28:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-07 15:28:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-07 15:28:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-07 15:28:51,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-07 15:28:51,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:28:51,316 INFO L225 Difference]: With dead ends: 96 [2022-04-07 15:28:51,316 INFO L226 Difference]: Without dead ends: 91 [2022-04-07 15:28:51,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-07 15:28:51,317 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:28:51,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 15:28:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-07 15:28:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-07 15:28:51,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:51,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 15:28:51,392 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 15:28:51,392 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 15:28:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:51,394 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-07 15:28:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-07 15:28:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:51,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-07 15:28:51,395 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-07 15:28:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:51,397 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-07 15:28:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-07 15:28:51,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:51,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:51,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:51,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 15:28:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-07 15:28:51,400 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-07 15:28:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:51,400 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-07 15:28:51,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-07 15:28:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-07 15:28:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-07 15:28:51,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:51,401 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:28:51,408 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-07 15:28:51,606 WARN L460 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-07 15:28:51,606 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 21 times [2022-04-07 15:28:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:51,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310057787] [2022-04-07 15:28:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:51,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:51,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971072791] [2022-04-07 15:28:51,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:28:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:51,621 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:28:51,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-07 15:28:52,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-04-07 15:28:52,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:28:52,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-07 15:28:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:28:53,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {15218#true} call ULTIMATE.init(); {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {15218#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15218#true} {15218#true} #60#return; {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {15218#true} call #t~ret5 := main(); {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {15218#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {15218#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15218#true} {15218#true} #52#return; {15218#true} is VALID [2022-04-07 15:28:53,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {15218#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:53,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {15256#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:53,310 INFO L272 TraceCheckUtils]: 13: Hoare triple {15256#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,311 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15218#true} {15256#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15256#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:28:53,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {15256#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:53,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:53,312 INFO L272 TraceCheckUtils]: 20: Hoare triple {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,313 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15218#true} {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:28:53,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {15278#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:28:53,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:28:53,314 INFO L272 TraceCheckUtils]: 27: Hoare triple {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15218#true} {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-07 15:28:53,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {15300#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-07 15:28:53,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-07 15:28:53,315 INFO L272 TraceCheckUtils]: 34: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,315 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15218#true} {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #54#return; {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-07 15:28:53,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {15322#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-07 15:28:53,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-07 15:28:53,316 INFO L272 TraceCheckUtils]: 41: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,317 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15218#true} {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-07 15:28:53,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {15344#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:53,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:53,318 INFO L272 TraceCheckUtils]: 48: Hoare triple {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,318 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15218#true} {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-07 15:28:53,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {15366#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:53,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {15388#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:53,319 INFO L272 TraceCheckUtils]: 55: Hoare triple {15388#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15218#true} {15388#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15388#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:28:53,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {15388#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:53,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:53,320 INFO L272 TraceCheckUtils]: 62: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,321 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15218#true} {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:28:53,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {15410#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:28:53,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:28:53,322 INFO L272 TraceCheckUtils]: 69: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,322 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15218#true} {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:28:53,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {15432#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,323 INFO L272 TraceCheckUtils]: 76: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,324 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15218#true} {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {15454#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-07 15:28:53,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-07 15:28:53,324 INFO L272 TraceCheckUtils]: 83: Hoare triple {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,325 INFO L290 TraceCheckUtils]: 85: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,325 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15218#true} {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-07 15:28:53,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {15476#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:53,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:53,326 INFO L272 TraceCheckUtils]: 90: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,326 INFO L290 TraceCheckUtils]: 91: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,326 INFO L290 TraceCheckUtils]: 93: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,326 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15218#true} {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-07 15:28:53,327 INFO L290 TraceCheckUtils]: 95: Hoare triple {15498#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,327 INFO L272 TraceCheckUtils]: 97: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,327 INFO L290 TraceCheckUtils]: 99: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,327 INFO L290 TraceCheckUtils]: 100: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,328 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15218#true} {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,328 INFO L290 TraceCheckUtils]: 102: Hoare triple {15520#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,328 INFO L290 TraceCheckUtils]: 103: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,329 INFO L272 TraceCheckUtils]: 104: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,329 INFO L290 TraceCheckUtils]: 105: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,329 INFO L290 TraceCheckUtils]: 106: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,329 INFO L290 TraceCheckUtils]: 107: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,329 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15218#true} {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-07 15:28:53,329 INFO L290 TraceCheckUtils]: 109: Hoare triple {15542#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,330 INFO L290 TraceCheckUtils]: 110: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,330 INFO L272 TraceCheckUtils]: 111: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,330 INFO L290 TraceCheckUtils]: 112: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,330 INFO L290 TraceCheckUtils]: 113: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,330 INFO L290 TraceCheckUtils]: 114: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,330 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15218#true} {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,331 INFO L290 TraceCheckUtils]: 116: Hoare triple {15564#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:53,331 INFO L290 TraceCheckUtils]: 117: Hoare triple {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:53,331 INFO L272 TraceCheckUtils]: 118: Hoare triple {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,331 INFO L290 TraceCheckUtils]: 119: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,331 INFO L290 TraceCheckUtils]: 120: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,331 INFO L290 TraceCheckUtils]: 121: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,332 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15218#true} {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:28:53,332 INFO L290 TraceCheckUtils]: 123: Hoare triple {15586#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:28:53,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:28:53,333 INFO L272 TraceCheckUtils]: 125: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,333 INFO L290 TraceCheckUtils]: 127: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,333 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15218#true} {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #54#return; {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:28:53,334 INFO L290 TraceCheckUtils]: 130: Hoare triple {15608#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,334 INFO L290 TraceCheckUtils]: 131: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !false; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,334 INFO L272 TraceCheckUtils]: 132: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,334 INFO L290 TraceCheckUtils]: 135: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,335 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15218#true} {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} #54#return; {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:28:53,335 INFO L290 TraceCheckUtils]: 137: Hoare triple {15630#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-07 15:28:53,335 INFO L290 TraceCheckUtils]: 138: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} assume !false; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-07 15:28:53,335 INFO L272 TraceCheckUtils]: 139: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,335 INFO L290 TraceCheckUtils]: 140: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,336 INFO L290 TraceCheckUtils]: 141: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,336 INFO L290 TraceCheckUtils]: 142: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,336 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15218#true} {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} #54#return; {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} is VALID [2022-04-07 15:28:53,336 INFO L290 TraceCheckUtils]: 144: Hoare triple {15652#(and (= (+ main_~c~0 (- 3)) 15) (= (+ main_~y~0 (- 4)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:53,337 INFO L290 TraceCheckUtils]: 145: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} assume !false; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:53,337 INFO L272 TraceCheckUtils]: 146: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,337 INFO L290 TraceCheckUtils]: 147: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,337 INFO L290 TraceCheckUtils]: 148: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,337 INFO L290 TraceCheckUtils]: 149: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,337 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15218#true} {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} #54#return; {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:28:53,338 INFO L290 TraceCheckUtils]: 151: Hoare triple {15674#(and (= 14 (+ main_~y~0 (- 5))) (= 15 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-07 15:28:53,338 INFO L290 TraceCheckUtils]: 152: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} assume !false; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-07 15:28:53,338 INFO L272 TraceCheckUtils]: 153: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,338 INFO L290 TraceCheckUtils]: 154: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,338 INFO L290 TraceCheckUtils]: 155: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,338 INFO L290 TraceCheckUtils]: 156: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,339 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15218#true} {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} #54#return; {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} is VALID [2022-04-07 15:28:53,339 INFO L290 TraceCheckUtils]: 158: Hoare triple {15696#(and (= 15 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-07 15:28:53,339 INFO L290 TraceCheckUtils]: 159: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-07 15:28:53,340 INFO L272 TraceCheckUtils]: 160: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15218#true} is VALID [2022-04-07 15:28:53,340 INFO L290 TraceCheckUtils]: 161: Hoare triple {15218#true} ~cond := #in~cond; {15218#true} is VALID [2022-04-07 15:28:53,340 INFO L290 TraceCheckUtils]: 162: Hoare triple {15218#true} assume !(0 == ~cond); {15218#true} is VALID [2022-04-07 15:28:53,340 INFO L290 TraceCheckUtils]: 163: Hoare triple {15218#true} assume true; {15218#true} is VALID [2022-04-07 15:28:53,340 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {15218#true} {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #54#return; {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-07 15:28:53,342 INFO L290 TraceCheckUtils]: 165: Hoare triple {15718#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {15740#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-07 15:28:53,342 INFO L272 TraceCheckUtils]: 166: Hoare triple {15740#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:28:53,343 INFO L290 TraceCheckUtils]: 167: Hoare triple {15744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:28:53,343 INFO L290 TraceCheckUtils]: 168: Hoare triple {15748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15219#false} is VALID [2022-04-07 15:28:53,343 INFO L290 TraceCheckUtils]: 169: Hoare triple {15219#false} assume !false; {15219#false} is VALID [2022-04-07 15:28:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 44 proven. 693 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-07 15:28:53,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:28:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:28:53,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310057787] [2022-04-07 15:28:53,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:28:53,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971072791] [2022-04-07 15:28:53,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971072791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:28:53,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:28:53,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-07 15:28:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332346233] [2022-04-07 15:28:53,670 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:28:53,671 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-07 15:28:53,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:28:53,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-07 15:28:53,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:28:53,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-07 15:28:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:28:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-07 15:28:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-07 15:28:53,791 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-07 15:28:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:58,545 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-07 15:28:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 15:28:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-07 15:28:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:28:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-07 15:28:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-07 15:28:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-07 15:28:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-07 15:28:58,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-07 15:28:58,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:28:58,673 INFO L225 Difference]: With dead ends: 99 [2022-04-07 15:28:58,673 INFO L226 Difference]: Without dead ends: 94 [2022-04-07 15:28:58,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-07 15:28:58,674 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 15:28:58,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 15:28:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-07 15:28:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-07 15:28:58,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:28:58,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 15:28:58,763 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 15:28:58,763 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 15:28:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:58,765 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-07 15:28:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-07 15:28:58,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:58,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:58,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-07 15:28:58,766 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-07 15:28:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:28:58,768 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-07 15:28:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-07 15:28:58,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:28:58,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:28:58,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:28:58,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:28:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 15:28:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-07 15:28:58,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-07 15:28:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:28:58,771 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-07 15:28:58,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-07 15:28:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-07 15:28:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-07 15:28:58,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:28:58,772 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:28:58,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-07 15:28:58,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:58,978 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:28:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:28:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 22 times [2022-04-07 15:28:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:28:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860345142] [2022-04-07 15:28:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:28:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:28:58,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:28:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385290068] [2022-04-07 15:28:58,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:28:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:28:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:28:59,008 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:28:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-07 15:28:59,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:28:59,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:28:59,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-07 15:28:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:28:59,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:29:00,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {16295#true} call ULTIMATE.init(); {16295#true} is VALID [2022-04-07 15:29:00,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {16295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {16295#true} is VALID [2022-04-07 15:29:00,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16295#true} {16295#true} #60#return; {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {16295#true} call #t~ret5 := main(); {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {16295#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {16295#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16295#true} {16295#true} #52#return; {16295#true} is VALID [2022-04-07 15:29:00,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {16295#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:00,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {16333#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:00,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {16333#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,554 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16295#true} {16333#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:00,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {16333#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:00,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {16355#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:00,555 INFO L272 TraceCheckUtils]: 20: Hoare triple {16355#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,556 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16295#true} {16355#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {16355#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:00,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {16355#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:00,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:00,556 INFO L272 TraceCheckUtils]: 27: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16295#true} {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:00,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {16377#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:00,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:00,558 INFO L272 TraceCheckUtils]: 34: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,558 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16295#true} {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:00,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {16399#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:29:00,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:29:00,559 INFO L272 TraceCheckUtils]: 41: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,560 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16295#true} {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-07 15:29:00,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {16421#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:00,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:00,561 INFO L272 TraceCheckUtils]: 48: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,561 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16295#true} {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:00,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {16443#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-07 15:29:00,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-07 15:29:00,562 INFO L272 TraceCheckUtils]: 55: Hoare triple {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,563 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16295#true} {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-07 15:29:00,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {16465#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:00,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:00,563 INFO L272 TraceCheckUtils]: 62: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,564 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16295#true} {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:00,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {16487#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-07 15:29:00,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-07 15:29:00,565 INFO L272 TraceCheckUtils]: 69: Hoare triple {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,565 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16295#true} {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #54#return; {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-07 15:29:00,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {16509#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:29:00,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:29:00,566 INFO L272 TraceCheckUtils]: 76: Hoare triple {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,567 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16295#true} {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-07 15:29:00,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {16531#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-07 15:29:00,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} assume !false; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-07 15:29:00,568 INFO L272 TraceCheckUtils]: 83: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,568 INFO L290 TraceCheckUtils]: 85: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,568 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16295#true} {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} #54#return; {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-07 15:29:00,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {16553#(and (= 8 (+ (- 2) main_~c~0)) (= 7 (+ main_~y~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-07 15:29:00,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} assume !false; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-07 15:29:00,569 INFO L272 TraceCheckUtils]: 90: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,569 INFO L290 TraceCheckUtils]: 91: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,569 INFO L290 TraceCheckUtils]: 92: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,569 INFO L290 TraceCheckUtils]: 93: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,570 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16295#true} {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} #54#return; {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-07 15:29:00,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {16575#(and (= (+ main_~c~0 (- 3)) 8) (= 7 (+ main_~y~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:00,570 INFO L290 TraceCheckUtils]: 96: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} assume !false; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:00,570 INFO L272 TraceCheckUtils]: 97: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,570 INFO L290 TraceCheckUtils]: 98: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,571 INFO L290 TraceCheckUtils]: 99: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,571 INFO L290 TraceCheckUtils]: 100: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,571 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16295#true} {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} #54#return; {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:00,571 INFO L290 TraceCheckUtils]: 102: Hoare triple {16597#(and (= main_~y~0 12) (= 8 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,572 INFO L290 TraceCheckUtils]: 103: Hoare triple {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,572 INFO L272 TraceCheckUtils]: 104: Hoare triple {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,572 INFO L290 TraceCheckUtils]: 105: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,572 INFO L290 TraceCheckUtils]: 106: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,572 INFO L290 TraceCheckUtils]: 107: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,572 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16295#true} {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {16619#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:00,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:00,573 INFO L272 TraceCheckUtils]: 111: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,573 INFO L290 TraceCheckUtils]: 112: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,573 INFO L290 TraceCheckUtils]: 113: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,574 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16295#true} {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:00,574 INFO L290 TraceCheckUtils]: 116: Hoare triple {16641#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:00,575 INFO L290 TraceCheckUtils]: 117: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:00,575 INFO L272 TraceCheckUtils]: 118: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,575 INFO L290 TraceCheckUtils]: 119: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,575 INFO L290 TraceCheckUtils]: 120: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,575 INFO L290 TraceCheckUtils]: 121: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,575 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16295#true} {16663#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {16663#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:00,576 INFO L290 TraceCheckUtils]: 123: Hoare triple {16663#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,576 INFO L290 TraceCheckUtils]: 124: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,576 INFO L272 TraceCheckUtils]: 125: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,576 INFO L290 TraceCheckUtils]: 126: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,576 INFO L290 TraceCheckUtils]: 127: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,576 INFO L290 TraceCheckUtils]: 128: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,577 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16295#true} {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:00,577 INFO L290 TraceCheckUtils]: 130: Hoare triple {16685#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-07 15:29:00,577 INFO L290 TraceCheckUtils]: 131: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-07 15:29:00,577 INFO L272 TraceCheckUtils]: 132: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,577 INFO L290 TraceCheckUtils]: 133: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,578 INFO L290 TraceCheckUtils]: 134: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,578 INFO L290 TraceCheckUtils]: 135: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,578 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16295#true} {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-07 15:29:00,578 INFO L290 TraceCheckUtils]: 137: Hoare triple {16707#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:00,579 INFO L290 TraceCheckUtils]: 138: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !false; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:00,579 INFO L272 TraceCheckUtils]: 139: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,579 INFO L290 TraceCheckUtils]: 140: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,579 INFO L290 TraceCheckUtils]: 141: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,579 INFO L290 TraceCheckUtils]: 142: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,579 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16295#true} {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} #54#return; {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:00,580 INFO L290 TraceCheckUtils]: 144: Hoare triple {16729#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-07 15:29:00,580 INFO L290 TraceCheckUtils]: 145: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-07 15:29:00,580 INFO L272 TraceCheckUtils]: 146: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,580 INFO L290 TraceCheckUtils]: 147: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,580 INFO L290 TraceCheckUtils]: 148: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,580 INFO L290 TraceCheckUtils]: 149: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,581 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16295#true} {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #54#return; {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-07 15:29:00,581 INFO L290 TraceCheckUtils]: 151: Hoare triple {16751#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-07 15:29:00,581 INFO L290 TraceCheckUtils]: 152: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-07 15:29:00,582 INFO L272 TraceCheckUtils]: 153: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,582 INFO L290 TraceCheckUtils]: 154: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,582 INFO L290 TraceCheckUtils]: 155: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,582 INFO L290 TraceCheckUtils]: 156: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,582 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16295#true} {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #54#return; {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-07 15:29:00,582 INFO L290 TraceCheckUtils]: 158: Hoare triple {16773#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:00,583 INFO L290 TraceCheckUtils]: 159: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:00,583 INFO L272 TraceCheckUtils]: 160: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,583 INFO L290 TraceCheckUtils]: 161: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,583 INFO L290 TraceCheckUtils]: 162: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,583 INFO L290 TraceCheckUtils]: 163: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,583 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16295#true} {16795#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {16795#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:00,584 INFO L290 TraceCheckUtils]: 165: Hoare triple {16795#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-07 15:29:00,584 INFO L290 TraceCheckUtils]: 166: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !false; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-07 15:29:00,584 INFO L272 TraceCheckUtils]: 167: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16295#true} is VALID [2022-04-07 15:29:00,584 INFO L290 TraceCheckUtils]: 168: Hoare triple {16295#true} ~cond := #in~cond; {16295#true} is VALID [2022-04-07 15:29:00,584 INFO L290 TraceCheckUtils]: 169: Hoare triple {16295#true} assume !(0 == ~cond); {16295#true} is VALID [2022-04-07 15:29:00,584 INFO L290 TraceCheckUtils]: 170: Hoare triple {16295#true} assume true; {16295#true} is VALID [2022-04-07 15:29:00,585 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {16295#true} {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} #54#return; {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-07 15:29:00,586 INFO L290 TraceCheckUtils]: 172: Hoare triple {16817#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {16839#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-07 15:29:00,586 INFO L272 TraceCheckUtils]: 173: Hoare triple {16839#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:29:00,587 INFO L290 TraceCheckUtils]: 174: Hoare triple {16843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:29:00,587 INFO L290 TraceCheckUtils]: 175: Hoare triple {16847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16296#false} is VALID [2022-04-07 15:29:00,587 INFO L290 TraceCheckUtils]: 176: Hoare triple {16296#false} assume !false; {16296#false} is VALID [2022-04-07 15:29:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-07 15:29:00,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:29:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:29:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860345142] [2022-04-07 15:29:00,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:29:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385290068] [2022-04-07 15:29:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385290068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:29:00,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:29:00,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-07 15:29:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284755624] [2022-04-07 15:29:00,899 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:29:00,899 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-07 15:29:00,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:29:00,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-07 15:29:01,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:01,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-07 15:29:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:29:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-07 15:29:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-07 15:29:01,015 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-07 15:29:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:05,900 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-07 15:29:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-07 15:29:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-07 15:29:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:29:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-07 15:29:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-07 15:29:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-07 15:29:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-07 15:29:05,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-07 15:29:06,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:06,044 INFO L225 Difference]: With dead ends: 102 [2022-04-07 15:29:06,044 INFO L226 Difference]: Without dead ends: 97 [2022-04-07 15:29:06,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 15:29:06,045 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 15:29:06,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1123 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 15:29:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-07 15:29:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-07 15:29:06,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:29:06,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 15:29:06,113 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 15:29:06,113 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 15:29:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:06,115 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-07 15:29:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-07 15:29:06,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:06,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:06,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-07 15:29:06,116 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-07 15:29:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:06,118 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-07 15:29:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-07 15:29:06,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:06,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:06,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:29:06,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:29:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 15:29:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-07 15:29:06,121 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-07 15:29:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:29:06,121 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-07 15:29:06,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-07 15:29:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-07 15:29:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-07 15:29:06,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:29:06,122 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:29:06,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-07 15:29:06,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-07 15:29:06,323 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:29:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:29:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 23 times [2022-04-07 15:29:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:29:06,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478897922] [2022-04-07 15:29:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:29:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:29:06,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:29:06,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595249220] [2022-04-07 15:29:06,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 15:29:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:29:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:29:06,338 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:29:06,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-07 15:29:26,721 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-07 15:29:26,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:29:26,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-07 15:29:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:29:26,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:29:27,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17410#true} {17410#true} #60#return; {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {17410#true} call #t~ret5 := main(); {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {17410#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {17410#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17410#true} {17410#true} #52#return; {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {17410#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {17448#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:27,720 INFO L272 TraceCheckUtils]: 13: Hoare triple {17448#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,721 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17410#true} {17448#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17448#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:27,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:27,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {17470#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:27,721 INFO L272 TraceCheckUtils]: 20: Hoare triple {17470#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,722 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17410#true} {17470#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {17470#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:29:27,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {17470#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:27,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:27,722 INFO L272 TraceCheckUtils]: 27: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,723 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17410#true} {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:29:27,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {17492#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:27,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {17514#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:27,723 INFO L272 TraceCheckUtils]: 34: Hoare triple {17514#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,724 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17410#true} {17514#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {17514#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:27,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {17514#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:27,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {17536#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:27,725 INFO L272 TraceCheckUtils]: 41: Hoare triple {17536#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,725 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17410#true} {17536#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {17536#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:27,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {17536#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,726 INFO L272 TraceCheckUtils]: 48: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,726 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17410#true} {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {17558#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,727 INFO L272 TraceCheckUtils]: 55: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,727 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17410#true} {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #54#return; {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-07 15:29:27,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {17580#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,728 INFO L272 TraceCheckUtils]: 62: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,728 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17410#true} {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {17602#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:29:27,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !false; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:29:27,729 INFO L272 TraceCheckUtils]: 69: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,729 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17410#true} {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #54#return; {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-07 15:29:27,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {17624#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:27,730 INFO L290 TraceCheckUtils]: 75: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !false; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:27,730 INFO L272 TraceCheckUtils]: 76: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,731 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17410#true} {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} #54#return; {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-07 15:29:27,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {17646#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:27,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:27,731 INFO L272 TraceCheckUtils]: 83: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,732 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17410#true} {17668#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {17668#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:27,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {17668#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:27,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:27,732 INFO L272 TraceCheckUtils]: 90: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,732 INFO L290 TraceCheckUtils]: 91: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,732 INFO L290 TraceCheckUtils]: 92: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,732 INFO L290 TraceCheckUtils]: 93: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,733 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17410#true} {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:27,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {17690#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-07 15:29:27,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-07 15:29:27,733 INFO L272 TraceCheckUtils]: 97: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,734 INFO L290 TraceCheckUtils]: 100: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,734 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17410#true} {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #54#return; {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-07 15:29:27,734 INFO L290 TraceCheckUtils]: 102: Hoare triple {17712#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-07 15:29:27,734 INFO L290 TraceCheckUtils]: 103: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-07 15:29:27,735 INFO L272 TraceCheckUtils]: 104: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,735 INFO L290 TraceCheckUtils]: 105: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,735 INFO L290 TraceCheckUtils]: 106: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,735 INFO L290 TraceCheckUtils]: 107: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,735 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17410#true} {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-07 15:29:27,735 INFO L290 TraceCheckUtils]: 109: Hoare triple {17734#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,736 INFO L290 TraceCheckUtils]: 110: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,736 INFO L272 TraceCheckUtils]: 111: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,736 INFO L290 TraceCheckUtils]: 114: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,736 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17410#true} {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:27,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {17756#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:27,737 INFO L290 TraceCheckUtils]: 117: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:27,737 INFO L272 TraceCheckUtils]: 118: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,737 INFO L290 TraceCheckUtils]: 119: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,737 INFO L290 TraceCheckUtils]: 120: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,737 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17410#true} {17778#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {17778#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:27,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {17778#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:27,738 INFO L290 TraceCheckUtils]: 124: Hoare triple {17800#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:27,738 INFO L272 TraceCheckUtils]: 125: Hoare triple {17800#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,738 INFO L290 TraceCheckUtils]: 126: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,738 INFO L290 TraceCheckUtils]: 127: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,738 INFO L290 TraceCheckUtils]: 128: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,738 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17410#true} {17800#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {17800#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:27,739 INFO L290 TraceCheckUtils]: 130: Hoare triple {17800#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:27,739 INFO L290 TraceCheckUtils]: 131: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:27,739 INFO L272 TraceCheckUtils]: 132: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,739 INFO L290 TraceCheckUtils]: 133: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,739 INFO L290 TraceCheckUtils]: 134: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,739 INFO L290 TraceCheckUtils]: 135: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,739 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17410#true} {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:27,740 INFO L290 TraceCheckUtils]: 137: Hoare triple {17822#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:27,740 INFO L290 TraceCheckUtils]: 138: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:27,740 INFO L272 TraceCheckUtils]: 139: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,740 INFO L290 TraceCheckUtils]: 140: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,740 INFO L290 TraceCheckUtils]: 141: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,740 INFO L290 TraceCheckUtils]: 142: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,740 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17410#true} {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:27,741 INFO L290 TraceCheckUtils]: 144: Hoare triple {17844#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:27,741 INFO L290 TraceCheckUtils]: 145: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !false; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:27,741 INFO L272 TraceCheckUtils]: 146: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,741 INFO L290 TraceCheckUtils]: 147: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,741 INFO L290 TraceCheckUtils]: 148: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,741 INFO L290 TraceCheckUtils]: 149: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,742 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17410#true} {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} #54#return; {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:27,742 INFO L290 TraceCheckUtils]: 151: Hoare triple {17866#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:27,742 INFO L290 TraceCheckUtils]: 152: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !false; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:27,742 INFO L272 TraceCheckUtils]: 153: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,742 INFO L290 TraceCheckUtils]: 154: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,742 INFO L290 TraceCheckUtils]: 155: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,742 INFO L290 TraceCheckUtils]: 156: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,743 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17410#true} {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} #54#return; {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:27,743 INFO L290 TraceCheckUtils]: 158: Hoare triple {17888#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:27,743 INFO L290 TraceCheckUtils]: 159: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:27,743 INFO L272 TraceCheckUtils]: 160: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,743 INFO L290 TraceCheckUtils]: 161: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,744 INFO L290 TraceCheckUtils]: 162: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,744 INFO L290 TraceCheckUtils]: 163: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,744 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17410#true} {17910#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {17910#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:27,744 INFO L290 TraceCheckUtils]: 165: Hoare triple {17910#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:27,744 INFO L290 TraceCheckUtils]: 166: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:27,744 INFO L272 TraceCheckUtils]: 167: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,745 INFO L290 TraceCheckUtils]: 168: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,745 INFO L290 TraceCheckUtils]: 169: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,745 INFO L290 TraceCheckUtils]: 170: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,745 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17410#true} {17932#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {17932#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:27,745 INFO L290 TraceCheckUtils]: 172: Hoare triple {17932#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:27,746 INFO L290 TraceCheckUtils]: 173: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:27,746 INFO L272 TraceCheckUtils]: 174: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17410#true} is VALID [2022-04-07 15:29:27,746 INFO L290 TraceCheckUtils]: 175: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-07 15:29:27,746 INFO L290 TraceCheckUtils]: 176: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-07 15:29:27,746 INFO L290 TraceCheckUtils]: 177: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-07 15:29:27,746 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {17410#true} {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #54#return; {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:27,748 INFO L290 TraceCheckUtils]: 179: Hoare triple {17954#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {17976#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:27,748 INFO L272 TraceCheckUtils]: 180: Hoare triple {17976#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:29:27,749 INFO L290 TraceCheckUtils]: 181: Hoare triple {17980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:29:27,766 INFO L290 TraceCheckUtils]: 182: Hoare triple {17984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17411#false} is VALID [2022-04-07 15:29:27,766 INFO L290 TraceCheckUtils]: 183: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-07 15:29:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 48 proven. 828 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2022-04-07 15:29:27,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:29:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:29:28,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478897922] [2022-04-07 15:29:28,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:29:28,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595249220] [2022-04-07 15:29:28,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595249220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:29:28,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:29:28,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-07 15:29:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787307363] [2022-04-07 15:29:28,056 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:29:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-07 15:29:28,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:29:28,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-07 15:29:28,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:28,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-07 15:29:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:29:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-07 15:29:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-07 15:29:28,179 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-07 15:29:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:33,719 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-07 15:29:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-07 15:29:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-07 15:29:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:29:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-07 15:29:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-07 15:29:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-07 15:29:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-07 15:29:33,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-07 15:29:33,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:33,978 INFO L225 Difference]: With dead ends: 105 [2022-04-07 15:29:33,978 INFO L226 Difference]: Without dead ends: 100 [2022-04-07 15:29:33,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 15:29:33,979 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-07 15:29:33,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-07 15:29:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-07 15:29:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-07 15:29:34,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:29:34,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 15:29:34,025 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 15:29:34,026 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 15:29:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:34,027 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-07 15:29:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-07 15:29:34,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:34,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:34,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-07 15:29:34,030 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-07 15:29:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:34,032 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-07 15:29:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-07 15:29:34,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:34,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:34,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:29:34,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:29:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 15:29:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-07 15:29:34,034 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-07 15:29:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:29:34,035 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-07 15:29:34,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-07 15:29:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-07 15:29:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-07 15:29:34,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:29:34,035 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:29:34,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-07 15:29:34,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-07 15:29:34,236 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:29:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:29:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 24 times [2022-04-07 15:29:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:29:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799144043] [2022-04-07 15:29:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:29:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:29:34,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:29:34,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274871054] [2022-04-07 15:29:34,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 15:29:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:29:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:29:34,254 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:29:34,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-07 15:29:35,051 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-07 15:29:35,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:29:35,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-07 15:29:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:29:35,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:29:35,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {18563#true} call ULTIMATE.init(); {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {18563#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18563#true} {18563#true} #60#return; {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {18563#true} call #t~ret5 := main(); {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {18563#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {18563#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18563#true} {18563#true} #52#return; {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {18563#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:35,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {18601#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,775 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18563#true} {18601#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {18601#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:35,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {18601#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:29:35,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:29:35,775 INFO L272 TraceCheckUtils]: 20: Hoare triple {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,776 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18563#true} {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-07 15:29:35,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {18623#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:29:35,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:29:35,776 INFO L272 TraceCheckUtils]: 27: Hoare triple {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,777 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18563#true} {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-07 15:29:35,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {18645#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:35,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {18667#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:35,777 INFO L272 TraceCheckUtils]: 34: Hoare triple {18667#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,778 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18563#true} {18667#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {18667#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:35,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {18667#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:35,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {18689#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:35,778 INFO L272 TraceCheckUtils]: 41: Hoare triple {18689#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,778 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18563#true} {18689#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {18689#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-07 15:29:35,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {18689#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:35,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:35,779 INFO L272 TraceCheckUtils]: 48: Hoare triple {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,779 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18563#true} {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:35,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {18711#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,780 INFO L272 TraceCheckUtils]: 55: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,780 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18563#true} {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {18733#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:35,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:35,781 INFO L272 TraceCheckUtils]: 62: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,781 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18563#true} {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:35,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {18755#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:35,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:35,782 INFO L272 TraceCheckUtils]: 69: Hoare triple {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,782 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18563#true} {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:35,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {18777#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:29:35,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:29:35,783 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,783 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18563#true} {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-07 15:29:35,784 INFO L290 TraceCheckUtils]: 81: Hoare triple {18799#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:35,784 INFO L290 TraceCheckUtils]: 82: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:35,784 INFO L272 TraceCheckUtils]: 83: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,784 INFO L290 TraceCheckUtils]: 85: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,784 INFO L290 TraceCheckUtils]: 86: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,784 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18563#true} {18821#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {18821#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-07 15:29:35,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {18821#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:35,785 INFO L290 TraceCheckUtils]: 89: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:35,785 INFO L272 TraceCheckUtils]: 90: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,785 INFO L290 TraceCheckUtils]: 91: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,785 INFO L290 TraceCheckUtils]: 92: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,785 INFO L290 TraceCheckUtils]: 93: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,785 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18563#true} {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-07 15:29:35,786 INFO L290 TraceCheckUtils]: 95: Hoare triple {18843#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-07 15:29:35,786 INFO L290 TraceCheckUtils]: 96: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-07 15:29:35,786 INFO L272 TraceCheckUtils]: 97: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,786 INFO L290 TraceCheckUtils]: 98: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,786 INFO L290 TraceCheckUtils]: 99: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,786 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18563#true} {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-07 15:29:35,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {18865#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-07 15:29:35,787 INFO L290 TraceCheckUtils]: 103: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !false; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-07 15:29:35,787 INFO L272 TraceCheckUtils]: 104: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,787 INFO L290 TraceCheckUtils]: 105: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,787 INFO L290 TraceCheckUtils]: 106: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,787 INFO L290 TraceCheckUtils]: 107: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,787 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18563#true} {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} #54#return; {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-07 15:29:35,788 INFO L290 TraceCheckUtils]: 109: Hoare triple {18887#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:29:35,788 INFO L290 TraceCheckUtils]: 110: Hoare triple {18909#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:29:35,788 INFO L272 TraceCheckUtils]: 111: Hoare triple {18909#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,788 INFO L290 TraceCheckUtils]: 112: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,788 INFO L290 TraceCheckUtils]: 114: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,788 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18563#true} {18909#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {18909#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-07 15:29:35,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {18909#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,789 INFO L290 TraceCheckUtils]: 117: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,789 INFO L272 TraceCheckUtils]: 118: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,789 INFO L290 TraceCheckUtils]: 119: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,789 INFO L290 TraceCheckUtils]: 120: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,789 INFO L290 TraceCheckUtils]: 121: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,789 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18563#true} {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:35,790 INFO L290 TraceCheckUtils]: 123: Hoare triple {18931#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,793 INFO L290 TraceCheckUtils]: 124: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !false; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,793 INFO L272 TraceCheckUtils]: 125: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,793 INFO L290 TraceCheckUtils]: 126: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,796 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18563#true} {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} #54#return; {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,796 INFO L290 TraceCheckUtils]: 130: Hoare triple {18953#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-07 15:29:35,796 INFO L290 TraceCheckUtils]: 131: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !false; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-07 15:29:35,796 INFO L272 TraceCheckUtils]: 132: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,797 INFO L290 TraceCheckUtils]: 133: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,797 INFO L290 TraceCheckUtils]: 134: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,797 INFO L290 TraceCheckUtils]: 135: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,797 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18563#true} {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} #54#return; {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} is VALID [2022-04-07 15:29:35,797 INFO L290 TraceCheckUtils]: 137: Hoare triple {18975#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:35,797 INFO L290 TraceCheckUtils]: 138: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !false; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:35,798 INFO L272 TraceCheckUtils]: 139: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,798 INFO L290 TraceCheckUtils]: 140: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,798 INFO L290 TraceCheckUtils]: 141: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,798 INFO L290 TraceCheckUtils]: 142: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,798 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18563#true} {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} #54#return; {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-07 15:29:35,798 INFO L290 TraceCheckUtils]: 144: Hoare triple {18997#(and (= (+ main_~y~0 (- 4)) 14) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:35,798 INFO L290 TraceCheckUtils]: 145: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} assume !false; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:35,799 INFO L272 TraceCheckUtils]: 146: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,799 INFO L290 TraceCheckUtils]: 147: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,799 INFO L290 TraceCheckUtils]: 148: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,799 INFO L290 TraceCheckUtils]: 149: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,799 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18563#true} {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} #54#return; {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:35,799 INFO L290 TraceCheckUtils]: 151: Hoare triple {19019#(and (= 14 (+ main_~y~0 (- 5))) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-07 15:29:35,800 INFO L290 TraceCheckUtils]: 152: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} assume !false; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-07 15:29:35,800 INFO L272 TraceCheckUtils]: 153: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,800 INFO L290 TraceCheckUtils]: 154: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,800 INFO L290 TraceCheckUtils]: 155: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,800 INFO L290 TraceCheckUtils]: 156: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,801 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18563#true} {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} #54#return; {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} is VALID [2022-04-07 15:29:35,802 INFO L290 TraceCheckUtils]: 158: Hoare triple {19041#(and (= (+ main_~y~0 (- 6)) 14) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-07 15:29:35,802 INFO L290 TraceCheckUtils]: 159: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} assume !false; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-07 15:29:35,802 INFO L272 TraceCheckUtils]: 160: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,802 INFO L290 TraceCheckUtils]: 161: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,802 INFO L290 TraceCheckUtils]: 162: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,802 INFO L290 TraceCheckUtils]: 163: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,802 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18563#true} {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} #54#return; {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} is VALID [2022-04-07 15:29:35,803 INFO L290 TraceCheckUtils]: 165: Hoare triple {19063#(and (= main_~c~0 21) (= 14 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:29:35,803 INFO L290 TraceCheckUtils]: 166: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} assume !false; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:29:35,803 INFO L272 TraceCheckUtils]: 167: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,803 INFO L290 TraceCheckUtils]: 168: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,803 INFO L290 TraceCheckUtils]: 169: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,803 INFO L290 TraceCheckUtils]: 170: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,803 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18563#true} {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} #54#return; {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} is VALID [2022-04-07 15:29:35,804 INFO L290 TraceCheckUtils]: 172: Hoare triple {19085#(and (= (+ (- 1) main_~c~0) 21) (= 14 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,804 INFO L290 TraceCheckUtils]: 173: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} assume !false; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,804 INFO L272 TraceCheckUtils]: 174: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,804 INFO L290 TraceCheckUtils]: 175: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,804 INFO L290 TraceCheckUtils]: 176: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,804 INFO L290 TraceCheckUtils]: 177: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,805 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18563#true} {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} #54#return; {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} is VALID [2022-04-07 15:29:35,805 INFO L290 TraceCheckUtils]: 179: Hoare triple {19107#(and (= 21 (+ (- 2) main_~c~0)) (= (+ (- 9) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-07 15:29:35,805 INFO L290 TraceCheckUtils]: 180: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-07 15:29:35,805 INFO L272 TraceCheckUtils]: 181: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18563#true} is VALID [2022-04-07 15:29:35,805 INFO L290 TraceCheckUtils]: 182: Hoare triple {18563#true} ~cond := #in~cond; {18563#true} is VALID [2022-04-07 15:29:35,805 INFO L290 TraceCheckUtils]: 183: Hoare triple {18563#true} assume !(0 == ~cond); {18563#true} is VALID [2022-04-07 15:29:35,805 INFO L290 TraceCheckUtils]: 184: Hoare triple {18563#true} assume true; {18563#true} is VALID [2022-04-07 15:29:35,806 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18563#true} {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #54#return; {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-07 15:29:35,807 INFO L290 TraceCheckUtils]: 186: Hoare triple {19129#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {19151#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-07 15:29:35,807 INFO L272 TraceCheckUtils]: 187: Hoare triple {19151#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:29:35,807 INFO L290 TraceCheckUtils]: 188: Hoare triple {19155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:29:35,808 INFO L290 TraceCheckUtils]: 189: Hoare triple {19159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18564#false} is VALID [2022-04-07 15:29:35,808 INFO L290 TraceCheckUtils]: 190: Hoare triple {18564#false} assume !false; {18564#false} is VALID [2022-04-07 15:29:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-04-07 15:29:35,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:29:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:29:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799144043] [2022-04-07 15:29:36,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:29:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274871054] [2022-04-07 15:29:36,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274871054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:29:36,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:29:36,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-07 15:29:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59360746] [2022-04-07 15:29:36,160 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:29:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-07 15:29:36,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:29:36,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-07 15:29:36,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:36,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-07 15:29:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:29:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-07 15:29:36,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 15:29:36,324 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-07 15:29:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:43,797 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-07 15:29:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-07 15:29:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-07 15:29:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:29:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-07 15:29:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-07 15:29:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-07 15:29:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-07 15:29:43,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-07 15:29:43,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:43,993 INFO L225 Difference]: With dead ends: 108 [2022-04-07 15:29:43,994 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 15:29:43,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-07 15:29:43,994 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-07 15:29:43,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-07 15:29:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 15:29:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-07 15:29:44,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:29:44,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 15:29:44,069 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 15:29:44,069 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 15:29:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:44,071 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-07 15:29:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-07 15:29:44,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:44,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:44,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-07 15:29:44,072 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-07 15:29:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:44,073 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-07 15:29:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-07 15:29:44,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:44,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:44,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:29:44,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:29:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 15:29:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-07 15:29:44,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-07 15:29:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:29:44,076 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-07 15:29:44,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-07 15:29:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-07 15:29:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-07 15:29:44,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:29:44,077 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:29:44,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-07 15:29:44,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-07 15:29:44,284 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:29:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:29:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 25 times [2022-04-07 15:29:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:29:44,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710854968] [2022-04-07 15:29:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:29:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:29:44,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:29:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414246555] [2022-04-07 15:29:44,298 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 15:29:44,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:29:44,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:29:44,299 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:29:44,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-07 15:29:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:29:45,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-07 15:29:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:29:45,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:29:46,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {19754#true} call ULTIMATE.init(); {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {19754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19754#true} {19754#true} #60#return; {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {19754#true} call #t~ret5 := main(); {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {19754#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {19754#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19754#true} {19754#true} #52#return; {19754#true} is VALID [2022-04-07 15:29:46,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {19754#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:46,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {19792#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:46,250 INFO L272 TraceCheckUtils]: 13: Hoare triple {19792#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19754#true} {19792#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19792#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:46,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {19792#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:29:46,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:29:46,252 INFO L272 TraceCheckUtils]: 20: Hoare triple {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,252 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19754#true} {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:29:46,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {19814#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-07 15:29:46,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-07 15:29:46,253 INFO L272 TraceCheckUtils]: 27: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,253 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19754#true} {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-07 15:29:46,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {19836#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:46,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:46,254 INFO L272 TraceCheckUtils]: 34: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,255 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19754#true} {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:29:46,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {19858#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,256 INFO L272 TraceCheckUtils]: 41: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,256 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19754#true} {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {19880#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:46,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:46,257 INFO L272 TraceCheckUtils]: 48: Hoare triple {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,258 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19754#true} {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:46,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {19902#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,258 INFO L272 TraceCheckUtils]: 55: Hoare triple {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,259 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19754#true} {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:46,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {19924#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:29:46,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:29:46,260 INFO L272 TraceCheckUtils]: 62: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,260 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19754#true} {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-07 15:29:46,261 INFO L290 TraceCheckUtils]: 67: Hoare triple {19946#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,261 INFO L272 TraceCheckUtils]: 69: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,261 INFO L290 TraceCheckUtils]: 70: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,261 INFO L290 TraceCheckUtils]: 71: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,262 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19754#true} {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #54#return; {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,262 INFO L290 TraceCheckUtils]: 74: Hoare triple {19968#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-07 15:29:46,262 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-07 15:29:46,262 INFO L272 TraceCheckUtils]: 76: Hoare triple {19990#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,263 INFO L290 TraceCheckUtils]: 79: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,263 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19754#true} {19990#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {19990#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-07 15:29:46,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {19990#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-07 15:29:46,264 INFO L290 TraceCheckUtils]: 82: Hoare triple {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-07 15:29:46,264 INFO L272 TraceCheckUtils]: 83: Hoare triple {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,264 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {19754#true} {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-07 15:29:46,265 INFO L290 TraceCheckUtils]: 88: Hoare triple {20012#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-07 15:29:46,265 INFO L290 TraceCheckUtils]: 89: Hoare triple {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-07 15:29:46,265 INFO L272 TraceCheckUtils]: 90: Hoare triple {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,265 INFO L290 TraceCheckUtils]: 91: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,266 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19754#true} {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-07 15:29:46,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {20034#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:29:46,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:29:46,266 INFO L272 TraceCheckUtils]: 97: Hoare triple {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,267 INFO L290 TraceCheckUtils]: 99: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,267 INFO L290 TraceCheckUtils]: 100: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,267 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19754#true} {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-07 15:29:46,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {20056#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-07 15:29:46,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-07 15:29:46,268 INFO L272 TraceCheckUtils]: 104: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,268 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19754#true} {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-07 15:29:46,269 INFO L290 TraceCheckUtils]: 109: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:46,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:46,269 INFO L272 TraceCheckUtils]: 111: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,269 INFO L290 TraceCheckUtils]: 113: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,269 INFO L290 TraceCheckUtils]: 114: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,270 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {19754#true} {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #54#return; {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:46,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:46,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:46,270 INFO L272 TraceCheckUtils]: 118: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,271 INFO L290 TraceCheckUtils]: 119: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,271 INFO L290 TraceCheckUtils]: 120: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,271 INFO L290 TraceCheckUtils]: 121: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,271 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19754#true} {20122#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {20122#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-07 15:29:46,271 INFO L290 TraceCheckUtils]: 123: Hoare triple {20122#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:46,272 INFO L290 TraceCheckUtils]: 124: Hoare triple {20144#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:46,272 INFO L272 TraceCheckUtils]: 125: Hoare triple {20144#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,272 INFO L290 TraceCheckUtils]: 126: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,272 INFO L290 TraceCheckUtils]: 127: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,272 INFO L290 TraceCheckUtils]: 128: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,272 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19754#true} {20144#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {20144#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:46,273 INFO L290 TraceCheckUtils]: 130: Hoare triple {20144#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:46,273 INFO L290 TraceCheckUtils]: 131: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:46,273 INFO L272 TraceCheckUtils]: 132: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,273 INFO L290 TraceCheckUtils]: 133: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,273 INFO L290 TraceCheckUtils]: 134: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,273 INFO L290 TraceCheckUtils]: 135: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,274 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {19754#true} {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:46,274 INFO L290 TraceCheckUtils]: 137: Hoare triple {20166#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,274 INFO L290 TraceCheckUtils]: 138: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !false; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,275 INFO L272 TraceCheckUtils]: 139: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,275 INFO L290 TraceCheckUtils]: 140: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,275 INFO L290 TraceCheckUtils]: 141: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,275 INFO L290 TraceCheckUtils]: 142: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,275 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {19754#true} {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} #54#return; {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:46,276 INFO L290 TraceCheckUtils]: 144: Hoare triple {20188#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:46,276 INFO L290 TraceCheckUtils]: 145: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:46,276 INFO L272 TraceCheckUtils]: 146: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,276 INFO L290 TraceCheckUtils]: 147: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,276 INFO L290 TraceCheckUtils]: 148: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,276 INFO L290 TraceCheckUtils]: 149: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,276 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {19754#true} {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-07 15:29:46,277 INFO L290 TraceCheckUtils]: 151: Hoare triple {20210#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-07 15:29:46,277 INFO L290 TraceCheckUtils]: 152: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-07 15:29:46,277 INFO L272 TraceCheckUtils]: 153: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,277 INFO L290 TraceCheckUtils]: 154: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,277 INFO L290 TraceCheckUtils]: 155: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,277 INFO L290 TraceCheckUtils]: 156: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,278 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19754#true} {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #54#return; {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-07 15:29:46,278 INFO L290 TraceCheckUtils]: 158: Hoare triple {20232#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:46,278 INFO L290 TraceCheckUtils]: 159: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:46,279 INFO L272 TraceCheckUtils]: 160: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,279 INFO L290 TraceCheckUtils]: 161: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,279 INFO L290 TraceCheckUtils]: 162: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,279 INFO L290 TraceCheckUtils]: 163: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,279 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {19754#true} {20254#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {20254#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-07 15:29:46,280 INFO L290 TraceCheckUtils]: 165: Hoare triple {20254#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:46,280 INFO L290 TraceCheckUtils]: 166: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:46,280 INFO L272 TraceCheckUtils]: 167: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,280 INFO L290 TraceCheckUtils]: 168: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,280 INFO L290 TraceCheckUtils]: 169: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,280 INFO L290 TraceCheckUtils]: 170: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,280 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {19754#true} {20276#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {20276#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:46,281 INFO L290 TraceCheckUtils]: 172: Hoare triple {20276#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:46,281 INFO L290 TraceCheckUtils]: 173: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:46,281 INFO L272 TraceCheckUtils]: 174: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,281 INFO L290 TraceCheckUtils]: 175: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,281 INFO L290 TraceCheckUtils]: 176: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,281 INFO L290 TraceCheckUtils]: 177: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,282 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {19754#true} {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #54#return; {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:46,282 INFO L290 TraceCheckUtils]: 179: Hoare triple {20298#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:46,282 INFO L290 TraceCheckUtils]: 180: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:46,283 INFO L272 TraceCheckUtils]: 181: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,283 INFO L290 TraceCheckUtils]: 182: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,283 INFO L290 TraceCheckUtils]: 183: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,283 INFO L290 TraceCheckUtils]: 184: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,283 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19754#true} {20320#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {20320#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:46,284 INFO L290 TraceCheckUtils]: 186: Hoare triple {20320#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:46,284 INFO L290 TraceCheckUtils]: 187: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:46,284 INFO L272 TraceCheckUtils]: 188: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19754#true} is VALID [2022-04-07 15:29:46,284 INFO L290 TraceCheckUtils]: 189: Hoare triple {19754#true} ~cond := #in~cond; {19754#true} is VALID [2022-04-07 15:29:46,284 INFO L290 TraceCheckUtils]: 190: Hoare triple {19754#true} assume !(0 == ~cond); {19754#true} is VALID [2022-04-07 15:29:46,284 INFO L290 TraceCheckUtils]: 191: Hoare triple {19754#true} assume true; {19754#true} is VALID [2022-04-07 15:29:46,285 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {19754#true} {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:46,287 INFO L290 TraceCheckUtils]: 193: Hoare triple {20342#(and (< 24 main_~k~0) (<= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !(~c~0 < ~k~0); {20364#(and (<= main_~k~0 25) (< 24 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:46,287 INFO L272 TraceCheckUtils]: 194: Hoare triple {20364#(and (<= main_~k~0 25) (< 24 main_~k~0) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:29:46,288 INFO L290 TraceCheckUtils]: 195: Hoare triple {20368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:29:46,288 INFO L290 TraceCheckUtils]: 196: Hoare triple {20372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19755#false} is VALID [2022-04-07 15:29:46,288 INFO L290 TraceCheckUtils]: 197: Hoare triple {19755#false} assume !false; {19755#false} is VALID [2022-04-07 15:29:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 52 proven. 975 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-07 15:29:46,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:29:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:29:46,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710854968] [2022-04-07 15:29:46,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:29:46,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414246555] [2022-04-07 15:29:46,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414246555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:29:46,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:29:46,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-07 15:29:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335661750] [2022-04-07 15:29:46,647 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:29:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-07 15:29:46,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:29:46,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-07 15:29:46,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:46,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 15:29:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:29:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 15:29:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 15:29:46,793 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-07 15:29:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:55,276 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-07 15:29:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 15:29:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-07 15:29:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:29:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-07 15:29:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-07 15:29:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-07 15:29:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-07 15:29:55,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-07 15:29:55,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:55,538 INFO L225 Difference]: With dead ends: 111 [2022-04-07 15:29:55,538 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 15:29:55,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2022-04-07 15:29:55,539 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:29:55,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-07 15:29:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 15:29:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-07 15:29:55,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:29:55,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-07 15:29:55,622 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-07 15:29:55,622 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-07 15:29:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:55,624 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-07 15:29:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-07 15:29:55,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:55,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:55,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-07 15:29:55,624 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-07 15:29:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:29:55,626 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-07 15:29:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-07 15:29:55,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:29:55,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:29:55,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:29:55,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:29:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-07 15:29:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-07 15:29:55,628 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-07 15:29:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:29:55,629 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-07 15:29:55,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-07 15:29:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-07 15:29:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-07 15:29:55,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:29:55,630 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:29:55,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-07 15:29:55,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-07 15:29:55,836 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:29:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:29:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 26 times [2022-04-07 15:29:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:29:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392411609] [2022-04-07 15:29:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:29:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:29:55,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:29:55,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380664801] [2022-04-07 15:29:55,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:29:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:29:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:29:55,851 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:29:55,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-07 15:29:56,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:29:56,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:29:56,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-07 15:29:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:29:56,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:29:57,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {20983#true} call ULTIMATE.init(); {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {20983#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20983#true} {20983#true} #60#return; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {20983#true} call #t~ret5 := main(); {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {20983#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {20983#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20983#true} {20983#true} #52#return; {20983#true} is VALID [2022-04-07 15:29:57,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {20983#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:57,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {21021#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:57,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {21021#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20983#true} {21021#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {21021#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:29:57,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {21021#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:29:57,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:29:57,600 INFO L272 TraceCheckUtils]: 20: Hoare triple {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,601 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {20983#true} {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:29:57,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {21043#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:29:57,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {21065#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:29:57,601 INFO L272 TraceCheckUtils]: 27: Hoare triple {21065#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,602 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20983#true} {21065#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {21065#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-07 15:29:57,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {21065#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:57,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {21087#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:57,603 INFO L272 TraceCheckUtils]: 34: Hoare triple {21087#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,603 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20983#true} {21087#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {21087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:29:57,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {21087#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,604 INFO L272 TraceCheckUtils]: 41: Hoare triple {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,606 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20983#true} {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {21109#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:57,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:57,606 INFO L272 TraceCheckUtils]: 48: Hoare triple {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,607 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20983#true} {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-07 15:29:57,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {21131#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !false; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,608 INFO L272 TraceCheckUtils]: 55: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,608 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20983#true} {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #54#return; {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:57,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:57,609 INFO L272 TraceCheckUtils]: 62: Hoare triple {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,610 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20983#true} {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-07 15:29:57,610 INFO L290 TraceCheckUtils]: 67: Hoare triple {21175#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:57,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:57,610 INFO L272 TraceCheckUtils]: 69: Hoare triple {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,610 INFO L290 TraceCheckUtils]: 70: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,611 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20983#true} {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-07 15:29:57,611 INFO L290 TraceCheckUtils]: 74: Hoare triple {21197#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,619 INFO L272 TraceCheckUtils]: 76: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,619 INFO L290 TraceCheckUtils]: 77: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,619 INFO L290 TraceCheckUtils]: 78: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,619 INFO L290 TraceCheckUtils]: 79: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,622 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20983#true} {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,622 INFO L290 TraceCheckUtils]: 81: Hoare triple {21219#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-07 15:29:57,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} assume !false; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-07 15:29:57,623 INFO L272 TraceCheckUtils]: 83: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,623 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20983#true} {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} #54#return; {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-07 15:29:57,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {21241#(and (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-07 15:29:57,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-07 15:29:57,624 INFO L272 TraceCheckUtils]: 90: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,624 INFO L290 TraceCheckUtils]: 93: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,625 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20983#true} {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #54#return; {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-07 15:29:57,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {21263#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:29:57,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {21285#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:29:57,625 INFO L272 TraceCheckUtils]: 97: Hoare triple {21285#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,626 INFO L290 TraceCheckUtils]: 99: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,626 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20983#true} {21285#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {21285#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-07 15:29:57,626 INFO L290 TraceCheckUtils]: 102: Hoare triple {21285#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:29:57,627 INFO L290 TraceCheckUtils]: 103: Hoare triple {21307#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:29:57,627 INFO L272 TraceCheckUtils]: 104: Hoare triple {21307#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,627 INFO L290 TraceCheckUtils]: 105: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,627 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20983#true} {21307#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {21307#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-07 15:29:57,628 INFO L290 TraceCheckUtils]: 109: Hoare triple {21307#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:57,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:57,628 INFO L272 TraceCheckUtils]: 111: Hoare triple {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,629 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {20983#true} {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-07 15:29:57,629 INFO L290 TraceCheckUtils]: 116: Hoare triple {21329#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,629 INFO L272 TraceCheckUtils]: 118: Hoare triple {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,629 INFO L290 TraceCheckUtils]: 119: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,630 INFO L290 TraceCheckUtils]: 120: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,630 INFO L290 TraceCheckUtils]: 121: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,630 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {20983#true} {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:29:57,630 INFO L290 TraceCheckUtils]: 123: Hoare triple {21351#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:57,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {21373#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:57,631 INFO L272 TraceCheckUtils]: 125: Hoare triple {21373#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,631 INFO L290 TraceCheckUtils]: 126: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,631 INFO L290 TraceCheckUtils]: 127: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,631 INFO L290 TraceCheckUtils]: 128: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,631 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20983#true} {21373#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {21373#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-07 15:29:57,632 INFO L290 TraceCheckUtils]: 130: Hoare triple {21373#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:57,632 INFO L290 TraceCheckUtils]: 131: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:57,632 INFO L272 TraceCheckUtils]: 132: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,632 INFO L290 TraceCheckUtils]: 133: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,632 INFO L290 TraceCheckUtils]: 134: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,632 INFO L290 TraceCheckUtils]: 135: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,633 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {20983#true} {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-07 15:29:57,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {21395#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:57,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:57,633 INFO L272 TraceCheckUtils]: 139: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,634 INFO L290 TraceCheckUtils]: 140: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,634 INFO L290 TraceCheckUtils]: 141: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,634 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {20983#true} {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #54#return; {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-07 15:29:57,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {21417#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,635 INFO L290 TraceCheckUtils]: 145: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !false; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,635 INFO L272 TraceCheckUtils]: 146: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,635 INFO L290 TraceCheckUtils]: 147: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,635 INFO L290 TraceCheckUtils]: 148: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,635 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {20983#true} {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} #54#return; {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,636 INFO L290 TraceCheckUtils]: 151: Hoare triple {21439#(and (= 16 (+ main_~c~0 (- 3))) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:57,636 INFO L290 TraceCheckUtils]: 152: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !false; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:57,636 INFO L272 TraceCheckUtils]: 153: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,636 INFO L290 TraceCheckUtils]: 154: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,636 INFO L290 TraceCheckUtils]: 155: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,636 INFO L290 TraceCheckUtils]: 156: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,637 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20983#true} {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} #54#return; {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} is VALID [2022-04-07 15:29:57,637 INFO L290 TraceCheckUtils]: 158: Hoare triple {21461#(and (= 16 (+ main_~c~0 (- 4))) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,637 INFO L290 TraceCheckUtils]: 159: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,638 INFO L272 TraceCheckUtils]: 160: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,638 INFO L290 TraceCheckUtils]: 161: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,638 INFO L290 TraceCheckUtils]: 162: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,638 INFO L290 TraceCheckUtils]: 163: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,638 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {20983#true} {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} #54#return; {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:29:57,639 INFO L290 TraceCheckUtils]: 165: Hoare triple {21483#(and (= 16 (+ main_~c~0 (- 5))) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:57,639 INFO L290 TraceCheckUtils]: 166: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:57,639 INFO L272 TraceCheckUtils]: 167: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,639 INFO L290 TraceCheckUtils]: 168: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,639 INFO L290 TraceCheckUtils]: 169: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,639 INFO L290 TraceCheckUtils]: 170: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,639 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {20983#true} {21505#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {21505#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-07 15:29:57,640 INFO L290 TraceCheckUtils]: 172: Hoare triple {21505#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:57,640 INFO L290 TraceCheckUtils]: 173: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:57,640 INFO L272 TraceCheckUtils]: 174: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,640 INFO L290 TraceCheckUtils]: 175: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,640 INFO L290 TraceCheckUtils]: 176: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,640 INFO L290 TraceCheckUtils]: 177: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,641 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {20983#true} {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #54#return; {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-07 15:29:57,641 INFO L290 TraceCheckUtils]: 179: Hoare triple {21527#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:57,642 INFO L290 TraceCheckUtils]: 180: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:57,642 INFO L272 TraceCheckUtils]: 181: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,642 INFO L290 TraceCheckUtils]: 182: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,642 INFO L290 TraceCheckUtils]: 183: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,642 INFO L290 TraceCheckUtils]: 184: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,642 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20983#true} {21549#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {21549#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-07 15:29:57,643 INFO L290 TraceCheckUtils]: 186: Hoare triple {21549#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:57,643 INFO L290 TraceCheckUtils]: 187: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:57,643 INFO L272 TraceCheckUtils]: 188: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,643 INFO L290 TraceCheckUtils]: 189: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,643 INFO L290 TraceCheckUtils]: 190: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,643 INFO L290 TraceCheckUtils]: 191: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,643 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {20983#true} {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-07 15:29:57,644 INFO L290 TraceCheckUtils]: 193: Hoare triple {21571#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-07 15:29:57,644 INFO L290 TraceCheckUtils]: 194: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-07 15:29:57,644 INFO L272 TraceCheckUtils]: 195: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20983#true} is VALID [2022-04-07 15:29:57,644 INFO L290 TraceCheckUtils]: 196: Hoare triple {20983#true} ~cond := #in~cond; {20983#true} is VALID [2022-04-07 15:29:57,644 INFO L290 TraceCheckUtils]: 197: Hoare triple {20983#true} assume !(0 == ~cond); {20983#true} is VALID [2022-04-07 15:29:57,644 INFO L290 TraceCheckUtils]: 198: Hoare triple {20983#true} assume true; {20983#true} is VALID [2022-04-07 15:29:57,645 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {20983#true} {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #54#return; {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-07 15:29:57,646 INFO L290 TraceCheckUtils]: 200: Hoare triple {21593#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {21615#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-07 15:29:57,646 INFO L272 TraceCheckUtils]: 201: Hoare triple {21615#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:29:57,647 INFO L290 TraceCheckUtils]: 202: Hoare triple {21619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:29:57,647 INFO L290 TraceCheckUtils]: 203: Hoare triple {21623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20984#false} is VALID [2022-04-07 15:29:57,647 INFO L290 TraceCheckUtils]: 204: Hoare triple {20984#false} assume !false; {20984#false} is VALID [2022-04-07 15:29:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-07 15:29:57,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:29:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:29:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392411609] [2022-04-07 15:29:57,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:29:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380664801] [2022-04-07 15:29:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380664801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:29:57,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:29:57,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-07 15:29:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20811545] [2022-04-07 15:29:57,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:29:57,919 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-07 15:29:57,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:29:57,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-07 15:29:58,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:29:58,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-07 15:29:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:29:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-07 15:29:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-07 15:29:58,099 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-07 15:30:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:30:07,076 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-07 15:30:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-07 15:30:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-07 15:30:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:30:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-07 15:30:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-07 15:30:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-07 15:30:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-07 15:30:07,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-07 15:30:07,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:30:07,399 INFO L225 Difference]: With dead ends: 114 [2022-04-07 15:30:07,399 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 15:30:07,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 15:30:07,400 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-07 15:30:07,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-07 15:30:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 15:30:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-07 15:30:07,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:30:07,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 15:30:07,481 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 15:30:07,481 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 15:30:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:30:07,483 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-07 15:30:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-07 15:30:07,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:30:07,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:30:07,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-07 15:30:07,483 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-07 15:30:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:30:07,485 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-07 15:30:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-07 15:30:07,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:30:07,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:30:07,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:30:07,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:30:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 15:30:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-07 15:30:07,488 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-07 15:30:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:30:07,488 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-07 15:30:07,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-07 15:30:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-07 15:30:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-07 15:30:07,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:30:07,489 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:30:07,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-07 15:30:07,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-07 15:30:07,695 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:30:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:30:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 27 times [2022-04-07 15:30:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:30:07,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655057640] [2022-04-07 15:30:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:30:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:30:07,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:30:07,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410899525] [2022-04-07 15:30:07,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:30:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:30:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:30:07,710 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:30:07,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-07 15:30:11,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-07 15:30:11,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:30:11,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-07 15:30:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:30:11,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:30:13,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {22250#true} call ULTIMATE.init(); {22250#true} is VALID [2022-04-07 15:30:13,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {22250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {22250#true} is VALID [2022-04-07 15:30:13,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22250#true} {22250#true} #60#return; {22250#true} is VALID [2022-04-07 15:30:13,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {22250#true} call #t~ret5 := main(); {22250#true} is VALID [2022-04-07 15:30:13,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {22250#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {22250#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22250#true} {22250#true} #52#return; {22250#true} is VALID [2022-04-07 15:30:13,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {22250#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:30:13,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {22288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:30:13,262 INFO L272 TraceCheckUtils]: 13: Hoare triple {22288#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,263 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22250#true} {22288#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:30:13,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {22288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:30:13,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:30:13,264 INFO L272 TraceCheckUtils]: 20: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,264 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22250#true} {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:30:13,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {22310#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:30:13,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:30:13,268 INFO L272 TraceCheckUtils]: 27: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,268 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22250#true} {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #54#return; {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:30:13,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {22332#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-07 15:30:13,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-07 15:30:13,270 INFO L272 TraceCheckUtils]: 34: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22250#true} {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-07 15:30:13,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {22354#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,272 INFO L272 TraceCheckUtils]: 41: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,272 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22250#true} {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {22376#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,273 INFO L272 TraceCheckUtils]: 48: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,274 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22250#true} {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {22398#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} assume !false; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,274 INFO L272 TraceCheckUtils]: 55: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,275 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22250#true} {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} #54#return; {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {22420#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 15:30:13,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 15:30:13,276 INFO L272 TraceCheckUtils]: 62: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,276 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22250#true} {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} #54#return; {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 15:30:13,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {22442#(and (= (+ (- 1) main_~c~0) 6) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,277 INFO L272 TraceCheckUtils]: 69: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,277 INFO L290 TraceCheckUtils]: 70: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,278 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22250#true} {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {22464#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,279 INFO L290 TraceCheckUtils]: 75: Hoare triple {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,279 INFO L272 TraceCheckUtils]: 76: Hoare triple {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,279 INFO L290 TraceCheckUtils]: 77: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,279 INFO L290 TraceCheckUtils]: 78: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,279 INFO L290 TraceCheckUtils]: 79: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,279 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22250#true} {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,280 INFO L290 TraceCheckUtils]: 81: Hoare triple {22486#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,280 INFO L290 TraceCheckUtils]: 82: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,280 INFO L272 TraceCheckUtils]: 83: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,280 INFO L290 TraceCheckUtils]: 84: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,281 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22250#true} {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {22508#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,282 INFO L272 TraceCheckUtils]: 90: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,282 INFO L290 TraceCheckUtils]: 92: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,282 INFO L290 TraceCheckUtils]: 93: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,282 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22250#true} {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,283 INFO L290 TraceCheckUtils]: 95: Hoare triple {22530#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,283 INFO L290 TraceCheckUtils]: 96: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,283 INFO L272 TraceCheckUtils]: 97: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,283 INFO L290 TraceCheckUtils]: 100: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,284 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22250#true} {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,284 INFO L290 TraceCheckUtils]: 102: Hoare triple {22552#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:30:13,284 INFO L290 TraceCheckUtils]: 103: Hoare triple {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:30:13,284 INFO L272 TraceCheckUtils]: 104: Hoare triple {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,284 INFO L290 TraceCheckUtils]: 105: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,284 INFO L290 TraceCheckUtils]: 106: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,285 INFO L290 TraceCheckUtils]: 107: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,285 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22250#true} {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-07 15:30:13,285 INFO L290 TraceCheckUtils]: 109: Hoare triple {22574#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:30:13,286 INFO L290 TraceCheckUtils]: 110: Hoare triple {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:30:13,286 INFO L272 TraceCheckUtils]: 111: Hoare triple {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,286 INFO L290 TraceCheckUtils]: 112: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,286 INFO L290 TraceCheckUtils]: 113: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,286 INFO L290 TraceCheckUtils]: 114: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,286 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22250#true} {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-07 15:30:13,287 INFO L290 TraceCheckUtils]: 116: Hoare triple {22596#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,287 INFO L290 TraceCheckUtils]: 117: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} assume !false; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,287 INFO L272 TraceCheckUtils]: 118: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,287 INFO L290 TraceCheckUtils]: 119: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,287 INFO L290 TraceCheckUtils]: 120: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,287 INFO L290 TraceCheckUtils]: 121: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,288 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22250#true} {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} #54#return; {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,288 INFO L290 TraceCheckUtils]: 123: Hoare triple {22618#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,289 INFO L290 TraceCheckUtils]: 124: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,289 INFO L272 TraceCheckUtils]: 125: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,289 INFO L290 TraceCheckUtils]: 126: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,289 INFO L290 TraceCheckUtils]: 127: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,289 INFO L290 TraceCheckUtils]: 128: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,289 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22250#true} {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,290 INFO L290 TraceCheckUtils]: 130: Hoare triple {22640#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:30:13,290 INFO L290 TraceCheckUtils]: 131: Hoare triple {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:30:13,290 INFO L272 TraceCheckUtils]: 132: Hoare triple {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,290 INFO L290 TraceCheckUtils]: 133: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,290 INFO L290 TraceCheckUtils]: 134: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,290 INFO L290 TraceCheckUtils]: 135: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,291 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22250#true} {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-07 15:30:13,291 INFO L290 TraceCheckUtils]: 137: Hoare triple {22662#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-07 15:30:13,291 INFO L290 TraceCheckUtils]: 138: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-07 15:30:13,291 INFO L272 TraceCheckUtils]: 139: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,292 INFO L290 TraceCheckUtils]: 140: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,292 INFO L290 TraceCheckUtils]: 141: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,292 INFO L290 TraceCheckUtils]: 142: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,292 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22250#true} {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-07 15:30:13,293 INFO L290 TraceCheckUtils]: 144: Hoare triple {22684#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-07 15:30:13,293 INFO L290 TraceCheckUtils]: 145: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-07 15:30:13,293 INFO L272 TraceCheckUtils]: 146: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,293 INFO L290 TraceCheckUtils]: 147: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,293 INFO L290 TraceCheckUtils]: 148: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,293 INFO L290 TraceCheckUtils]: 149: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,294 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22250#true} {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} #54#return; {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-07 15:30:13,294 INFO L290 TraceCheckUtils]: 151: Hoare triple {22706#(and (= (+ (- 2) main_~y~0) 17) (< 0 main_~k~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,294 INFO L290 TraceCheckUtils]: 152: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} assume !false; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,294 INFO L272 TraceCheckUtils]: 153: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,294 INFO L290 TraceCheckUtils]: 154: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,294 INFO L290 TraceCheckUtils]: 155: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,295 INFO L290 TraceCheckUtils]: 156: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,295 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22250#true} {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} #54#return; {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,295 INFO L290 TraceCheckUtils]: 158: Hoare triple {22728#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,296 INFO L290 TraceCheckUtils]: 159: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,296 INFO L272 TraceCheckUtils]: 160: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,296 INFO L290 TraceCheckUtils]: 161: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,296 INFO L290 TraceCheckUtils]: 162: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,296 INFO L290 TraceCheckUtils]: 163: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,296 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22250#true} {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,297 INFO L290 TraceCheckUtils]: 165: Hoare triple {22750#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,297 INFO L290 TraceCheckUtils]: 166: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,297 INFO L272 TraceCheckUtils]: 167: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,297 INFO L290 TraceCheckUtils]: 168: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,297 INFO L290 TraceCheckUtils]: 169: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,297 INFO L290 TraceCheckUtils]: 170: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,298 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22250#true} {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} #54#return; {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,298 INFO L290 TraceCheckUtils]: 172: Hoare triple {22772#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,299 INFO L290 TraceCheckUtils]: 173: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} assume !false; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,299 INFO L272 TraceCheckUtils]: 174: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,299 INFO L290 TraceCheckUtils]: 175: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,299 INFO L290 TraceCheckUtils]: 176: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,299 INFO L290 TraceCheckUtils]: 177: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,299 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22250#true} {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} #54#return; {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,300 INFO L290 TraceCheckUtils]: 179: Hoare triple {22794#(and (= 23 main_~y~0) (= 23 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,300 INFO L290 TraceCheckUtils]: 180: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !false; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,300 INFO L272 TraceCheckUtils]: 181: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,300 INFO L290 TraceCheckUtils]: 182: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,300 INFO L290 TraceCheckUtils]: 183: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,300 INFO L290 TraceCheckUtils]: 184: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,301 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22250#true} {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} #54#return; {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,301 INFO L290 TraceCheckUtils]: 186: Hoare triple {22816#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,301 INFO L290 TraceCheckUtils]: 187: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} assume !false; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,302 INFO L272 TraceCheckUtils]: 188: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,302 INFO L290 TraceCheckUtils]: 189: Hoare triple {22250#true} ~cond := #in~cond; {22250#true} is VALID [2022-04-07 15:30:13,302 INFO L290 TraceCheckUtils]: 190: Hoare triple {22250#true} assume !(0 == ~cond); {22250#true} is VALID [2022-04-07 15:30:13,302 INFO L290 TraceCheckUtils]: 191: Hoare triple {22250#true} assume true; {22250#true} is VALID [2022-04-07 15:30:13,302 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22250#true} {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} #54#return; {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,303 INFO L290 TraceCheckUtils]: 193: Hoare triple {22838#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,303 INFO L290 TraceCheckUtils]: 194: Hoare triple {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} assume !false; {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} is VALID [2022-04-07 15:30:13,303 INFO L272 TraceCheckUtils]: 195: Hoare triple {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,303 INFO L290 TraceCheckUtils]: 196: Hoare triple {22250#true} ~cond := #in~cond; {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:30:13,303 INFO L290 TraceCheckUtils]: 197: Hoare triple {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:30:13,304 INFO L290 TraceCheckUtils]: 198: Hoare triple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:30:13,304 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} {22860#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0))} #54#return; {22881#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-07 15:30:13,306 INFO L290 TraceCheckUtils]: 200: Hoare triple {22881#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} is VALID [2022-04-07 15:30:13,306 INFO L290 TraceCheckUtils]: 201: Hoare triple {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} assume !false; {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} is VALID [2022-04-07 15:30:13,306 INFO L272 TraceCheckUtils]: 202: Hoare triple {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22250#true} is VALID [2022-04-07 15:30:13,306 INFO L290 TraceCheckUtils]: 203: Hoare triple {22250#true} ~cond := #in~cond; {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:30:13,307 INFO L290 TraceCheckUtils]: 204: Hoare triple {22870#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:30:13,307 INFO L290 TraceCheckUtils]: 205: Hoare triple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:30:13,308 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {22874#(not (= |__VERIFIER_assert_#in~cond| 0))} {22885#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0))} #54#return; {22904#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-07 15:30:13,308 INFO L290 TraceCheckUtils]: 207: Hoare triple {22904#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {22908#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-07 15:30:13,309 INFO L272 TraceCheckUtils]: 208: Hoare triple {22908#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:30:13,309 INFO L290 TraceCheckUtils]: 209: Hoare triple {22912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:30:13,309 INFO L290 TraceCheckUtils]: 210: Hoare triple {22916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22251#false} is VALID [2022-04-07 15:30:13,309 INFO L290 TraceCheckUtils]: 211: Hoare triple {22251#false} assume !false; {22251#false} is VALID [2022-04-07 15:30:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 210 proven. 1136 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2022-04-07 15:30:13,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:31:29,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 5) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (<= c_main_~k~0 (+ 2 c_main_~c~0)) (not (= (mod (+ (* (- 6) .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (< (+ 3 c_main_~c~0) c_main_~k~0))) is different from false [2022-04-07 15:33:01,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_main_~y~0))) (or (< (+ 6 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 11)) (not (= (mod (+ (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 5 c_main_~c~0)))) is different from false [2022-04-07 15:34:06,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_main_~y~0))) (or (< (+ c_main_~c~0 8) c_main_~k~0) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6))) 4) 0)) (<= c_main_~k~0 (+ 7 c_main_~c~0)) (= (+ (* 2 c_main_~y~0) 15 (* .cse0 .cse0)) (+ c_main_~k~0 (* .cse0 c_main_~k~0))))) is different from false [2022-04-07 15:34:14,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 c_main_~y~0))) (or (not (= (mod (+ (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (< (+ 9 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ c_main_~c~0 8)) (= (+ (* 2 c_main_~y~0) 17 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)))) is different from false [2022-04-07 15:34:22,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 9 c_main_~y~0))) (or (= (+ (* .cse0 .cse0) 19 (* 2 c_main_~y~0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0)) 4) 0)) (< (+ c_main_~c~0 10) c_main_~k~0) (<= c_main_~k~0 (+ 9 c_main_~c~0)))) is different from false [2022-04-07 15:34:30,548 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 10 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 21 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (not (= (mod (+ (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ c_main_~c~0 10)) (< (+ c_main_~c~0 11) c_main_~k~0))) is different from false [2022-04-07 15:36:06,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 13 c_main_~y~0))) (or (not (= (mod (+ (* (- 13) .cse0 .cse0) (* (- 6) .cse0 .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ c_main_~c~0 13)) (< (+ 14 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 27)))) is different from false [2022-04-07 15:36:14,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 14 c_main_~y~0))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 29 (* .cse0 .cse0))) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* .cse0 .cse0 (- 13))) 4) 0)) (< (+ c_main_~c~0 15) c_main_~k~0) (<= c_main_~k~0 (+ 14 c_main_~c~0)))) is different from false [2022-04-07 15:36:22,525 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 15 c_main_~y~0))) (or (<= c_main_~k~0 (+ c_main_~c~0 15)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0)) 4) 0)) (< (+ 16 c_main_~c~0) c_main_~k~0) (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 31) (+ (* .cse0 c_main_~k~0) c_main_~k~0)))) is different from false [2022-04-07 15:37:07,422 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 17 c_main_~y~0))) (or (= (+ (* .cse0 .cse0) (* 2 c_main_~y~0) 35) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (<= c_main_~k~0 (+ c_main_~c~0 17)) (not (= (mod (+ (* .cse0 .cse0 .cse0 (- 6)) (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 (- 13))) 4) 0)) (< (+ c_main_~c~0 18) c_main_~k~0))) is different from false [2022-04-07 15:37:15,544 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 18 c_main_~y~0))) (or (<= c_main_~k~0 (+ c_main_~c~0 18)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0)) 4) 0)) (< (+ 19 c_main_~c~0) c_main_~k~0) (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 37) (+ (* .cse0 c_main_~k~0) c_main_~k~0)))) is different from false [2022-04-07 15:39:05,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 22 c_main_~y~0))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* .cse0 .cse0) (* 2 c_main_~y~0) 45)) (not (= (mod (+ (* (- 6) .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* (- 1) .cse0 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 22 c_main_~c~0)) (< (+ 23 c_main_~c~0) c_main_~k~0))) is different from false