/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:36:26,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:36:26,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:36:26,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:36:26,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:36:26,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:36:26,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:36:26,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:36:26,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:36:26,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:36:26,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:36:26,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:36:26,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:36:26,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:36:26,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:36:26,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:36:26,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:36:26,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:36:26,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:36:26,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:36:26,685 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:36:26,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:36:26,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:36:26,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:36:26,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:36:26,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:36:26,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:36:26,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:36:26,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:36:26,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:36:26,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:36:26,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:36:26,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:36:26,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:36:26,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:36:26,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:36:26,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:36:26,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:36:26,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:36:26,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:36:26,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:36:26,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:36:26,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:36:26,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:36:26,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:36:26,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:36:26,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:36:26,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:36:26,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:36:26,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:36:26,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:36:26,721 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:36:26,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:36:26,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:36:26,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:36:26,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:36:26,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:36:26,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:36:26,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:36:26,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:36:26,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:36:26,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:36:26,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:36:26,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:36:26,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-27 14:36:26,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4879afb4/29acffb83ac84b62818e359b3656736f/FLAG486981f97 [2022-04-27 14:36:27,281 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:36:27,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound10.c [2022-04-27 14:36:27,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4879afb4/29acffb83ac84b62818e359b3656736f/FLAG486981f97 [2022-04-27 14:36:27,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4879afb4/29acffb83ac84b62818e359b3656736f [2022-04-27 14:36:27,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:36:27,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:36:27,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:36:27,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:36:27,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:36:27,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5162b95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27, skipping insertion in model container [2022-04-27 14:36:27,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:36:27,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:36:27,462 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_valuebound10.c[458,471] [2022-04-27 14:36:27,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:36:27,492 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:36:27,500 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_valuebound10.c[458,471] [2022-04-27 14:36:27,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:36:27,516 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:36:27,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27 WrapperNode [2022-04-27 14:36:27,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:36:27,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:36:27,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:36:27,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:36:27,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:36:27,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:36:27,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:36:27,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:36:27,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (1/1) ... [2022-04-27 14:36:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:36:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:27,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:36:27,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:36:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:36:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:36:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:36:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:36:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:36:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:36:27,626 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:36:27,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:36:27,759 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:36:27,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:36:27,763 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:36:27,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:36:27 BoogieIcfgContainer [2022-04-27 14:36:27,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:36:27,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:36:27,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:36:27,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:36:27,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:36:27" (1/3) ... [2022-04-27 14:36:27,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c407c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:36:27, skipping insertion in model container [2022-04-27 14:36:27,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:27" (2/3) ... [2022-04-27 14:36:27,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c407c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:36:27, skipping insertion in model container [2022-04-27 14:36:27,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:36:27" (3/3) ... [2022-04-27 14:36:27,775 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.c [2022-04-27 14:36:27,798 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:36:27,798 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:36:27,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:36:27,851 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@342f8aab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63c51ee5 [2022-04-27 14:36:27,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:36:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:36:27,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:27,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:27,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:36:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:27,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559734461] [2022-04-27 14:36:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:36:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:28,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:36:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:36:28,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:36:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:36:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:28,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:36:28,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:36:28,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:36:28,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:36:28,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:36:28,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:36:28,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:36:28,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:36:28,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:36:28,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-27 14:36:28,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {31#true} is VALID [2022-04-27 14:36:28,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:36:28,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:36:28,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:36:28,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:36:28,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 14:36:28,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:36:28,077 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-27 14:36:28,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:36:28,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:36:28,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:36:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559734461] [2022-04-27 14:36:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559734461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:36:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760932485] [2022-04-27 14:36:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:28,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:36:28,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:28,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:28,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:36:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:28,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:36:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:36:28,136 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,246 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:36:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:36:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:36:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:36:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:36:28,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:36:28,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:28,361 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:36:28,361 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:36:28,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:36:28,364 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:28,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:36:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:36:28,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:28,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:28,392 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:28,392 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,395 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:36:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:28,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:28,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:28,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:36:28,397 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:36:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,400 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:36:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:28,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:28,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:28,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:28,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:36:28,403 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:36:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:28,403 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:36:28,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:36:28,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:28,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:28,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:36:28,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:36:28,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:28,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818789183] [2022-04-27 14:36:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:28,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:28,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491676246] [2022-04-27 14:36:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:28,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:28,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:28,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:28,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:36:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:28,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:36:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:28,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:28,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:36:28,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {186#true} is VALID [2022-04-27 14:36:28,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:36:28,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:36:28,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:36:28,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {186#true} is VALID [2022-04-27 14:36:28,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {186#true} is VALID [2022-04-27 14:36:28,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:36:28,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:36:28,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:36:28,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:36:28,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:28,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:28,608 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:28,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:28,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:36:28,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:36:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:28,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:36:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:28,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818789183] [2022-04-27 14:36:28,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:28,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491676246] [2022-04-27 14:36:28,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491676246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:28,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:28,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:36:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571680176] [2022-04-27 14:36:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:36:28,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:28,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:28,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:36:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:36:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:36:28,624 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,718 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:36:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:36:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:36:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:36:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:36:28,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:36:28,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:28,762 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:36:28,762 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:36:28,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:36:28,764 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:28,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:36:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:36:28,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:28,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:28,771 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:28,771 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,774 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:36:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:28,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:28,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:28,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:36:28,778 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:36:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:28,780 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:36:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:28,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:28,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:28,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:28,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:36:28,788 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:36:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:28,788 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:36:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:36:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:36:28,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:28,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:28,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:36:29,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:29,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:36:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:29,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218110436] [2022-04-27 14:36:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:29,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081850958] [2022-04-27 14:36:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:29,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:29,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:36:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:29,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:36:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:29,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:29,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:36:29,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:36:29,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:36:29,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:36:29,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:36:29,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:29,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:29,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:29,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:36:29,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:29,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:29,225 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:29,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:29,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:29,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,226 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:29,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:36:29,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:36:29,228 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:29,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:29,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:36:29,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:36:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:29,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:29,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:36:29,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:36:29,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:29,444 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:29,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:29,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:29,481 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:29,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:29,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:29,481 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:29,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:29,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:29,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:36:29,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:29,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:29,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:29,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:36:29,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:36:29,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:36:29,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:29,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:36:29,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:36:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:36:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:29,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218110436] [2022-04-27 14:36:29,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:29,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081850958] [2022-04-27 14:36:29,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081850958] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:29,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:29,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:36:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805096910] [2022-04-27 14:36:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:36:29,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:29,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:36:29,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:29,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:36:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:36:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:36:29,509 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:36:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,597 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:36:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:36:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:36:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:36:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:36:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:36:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:36:29,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:36:29,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:29,627 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:36:29,627 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:36:29,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:36:29,628 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:29,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:36:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:36:29,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:29,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:29,637 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:29,637 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,638 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:36:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:29,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:29,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:29,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:36:29,639 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:36:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,640 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:36:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:29,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:29,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:29,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:29,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:36:29,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:36:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:29,641 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:36:29,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:36:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:36:29,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:29,642 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:29,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:36:29,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:36:29,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:36:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570714913] [2022-04-27 14:36:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:29,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:29,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648178344] [2022-04-27 14:36:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:29,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:29,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:36:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:29,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:36:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:29,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:30,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:30,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:36:30,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {707#true} is VALID [2022-04-27 14:36:30,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:30,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:30,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:36:30,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:30,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:30,159 INFO L272 TraceCheckUtils]: 13: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:30,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:30,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:30,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:30,166 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#true} {745#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:30,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:30,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:30,167 INFO L272 TraceCheckUtils]: 20: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:30,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:30,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:30,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:30,168 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {707#true} {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:30,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:30,171 INFO L272 TraceCheckUtils]: 26: Hoare triple {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:30,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:30,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:36:30,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:36:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:36:30,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:30,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570714913] [2022-04-27 14:36:30,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:30,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648178344] [2022-04-27 14:36:30,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648178344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:30,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:30,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:36:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297992958] [2022-04-27 14:36:30,436 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:30,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:30,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:30,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:36:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:30,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:36:30,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:36:30,459 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,625 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:36:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:36:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:36:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:36:30,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 14:36:30,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:30,653 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:36:30,653 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:36:30,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:36:30,654 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:30,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:36:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:36:30,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:30,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:30,663 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:30,663 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,664 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:30,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:30,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:30,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:30,665 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:30,666 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:30,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:30,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:30,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:30,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:36:30,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:36:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:30,667 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:36:30,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:36:30,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:30,668 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:30,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:30,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:30,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:36:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113796967] [2022-04-27 14:36:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:30,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:30,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812105651] [2022-04-27 14:36:30,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:30,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:30,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:30,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:36:30,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:30,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:30,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:36:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:31,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:36:31,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1024#true} is VALID [2022-04-27 14:36:31,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:31,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-27 14:36:31,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-27 14:36:31,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-27 14:36:31,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:31,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:31,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:31,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:31,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:31,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:31,194 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1024#true} {1062#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:31,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:31,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:31,195 INFO L272 TraceCheckUtils]: 20: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:31,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:31,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:31,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:31,196 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1024#true} {1084#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:31,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:31,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:31,197 INFO L272 TraceCheckUtils]: 27: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:31,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:31,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:31,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:31,198 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1024#true} {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #54#return; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:31,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:36:31,199 INFO L272 TraceCheckUtils]: 33: Hoare triple {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:31,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:31,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:36:31,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:36:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:36:31,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:31,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113796967] [2022-04-27 14:36:31,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:31,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812105651] [2022-04-27 14:36:31,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812105651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:31,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:31,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:36:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117382012] [2022-04-27 14:36:31,459 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:31,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:31,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:31,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:31,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:31,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:36:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:36:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:36:31,488 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:31,682 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-27 14:36:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:36:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:36:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:36:31,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 14:36:31,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:31,712 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:36:31,712 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:36:31,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:36:31,713 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:31,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:36:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:36:31,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:31,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:31,724 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:31,724 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:31,726 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:36:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:31,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:31,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:31,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:36:31,726 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:36:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:31,727 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:36:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:31,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:31,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:31,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:31,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 14:36:31,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 14:36:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:31,729 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 14:36:31,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:36:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:31,730 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:31,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:36:31,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:31,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-27 14:36:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:31,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657649543] [2022-04-27 14:36:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:31,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:31,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833604591] [2022-04-27 14:36:31,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:31,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:31,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:36:32,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:36:32,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:32,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:36:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:32,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:32,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:32,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-27 14:36:32,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:32,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:32,338 INFO L272 TraceCheckUtils]: 13: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:32,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:32,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:32,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,339 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1379#true} {1417#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:32,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:32,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:32,349 INFO L272 TraceCheckUtils]: 20: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:32,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:32,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:32,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,350 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1379#true} {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:32,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:32,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:32,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:32,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:32,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:32,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,351 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1379#true} {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:32,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:32,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:32,352 INFO L272 TraceCheckUtils]: 34: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:32,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:32,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:32,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:32,353 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1379#true} {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #54#return; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:32,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:32,354 INFO L272 TraceCheckUtils]: 40: Hoare triple {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:32,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:32,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 14:36:32,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 14:36:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:36:32,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657649543] [2022-04-27 14:36:32,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833604591] [2022-04-27 14:36:32,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833604591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:32,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:32,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:36:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051443848] [2022-04-27 14:36:32,586 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:36:32,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:32,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:32,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:32,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:36:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:36:32,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:36:32,609 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,866 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-27 14:36:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:36:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:36:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:36:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:36:32,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:36:32,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:32,897 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:36:32,897 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 14:36:32,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:36:32,898 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:32,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 14:36:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 14:36:32,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:32,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:32,908 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:32,908 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,909 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:36:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:32,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 14:36:32,910 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 14:36:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,911 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:36:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:32,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:32,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 14:36:32,913 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 14:36:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:32,913 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 14:36:32,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:36:32,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:32,914 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:32,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:33,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:33,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-27 14:36:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:33,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713226375] [2022-04-27 14:36:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:33,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:33,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:33,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1659776401] [2022-04-27 14:36:33,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:36:33,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:33,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:33,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:33,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:36:33,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:36:33,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:33,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:36:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:33,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:33,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1772#true} is VALID [2022-04-27 14:36:33,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:33,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-27 14:36:33,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:33,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:33,560 INFO L272 TraceCheckUtils]: 13: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:33,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,560 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1772#true} {1810#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:33,561 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) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:36:33,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:36:33,561 INFO L272 TraceCheckUtils]: 20: Hoare triple {1832#(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)); {1772#true} is VALID [2022-04-27 14:36:33,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,562 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1772#true} {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:36:33,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {1832#(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; {1854#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:33,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1854#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:33,563 INFO L272 TraceCheckUtils]: 27: Hoare triple {1854#(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)); {1772#true} is VALID [2022-04-27 14:36:33,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,564 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1772#true} {1854#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1854#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:33,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#(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; {1876#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:33,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {1876#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:33,565 INFO L272 TraceCheckUtils]: 34: Hoare triple {1876#(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)); {1772#true} is VALID [2022-04-27 14:36:33,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,565 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1772#true} {1876#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {1876#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:33,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {1876#(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; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:33,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:33,571 INFO L272 TraceCheckUtils]: 41: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:33,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:33,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:33,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:33,571 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#true} {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:33,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:36:33,572 INFO L272 TraceCheckUtils]: 47: Hoare triple {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:33,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:33,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-27 14:36:33,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-27 14:36:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:36:33,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:34,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713226375] [2022-04-27 14:36:34,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:34,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659776401] [2022-04-27 14:36:34,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659776401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:34,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:34,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:36:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976155210] [2022-04-27 14:36:34,020 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:36:34,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:34,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:34,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:34,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:36:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:36:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:36:34,046 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:34,402 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-27 14:36:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:36:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:36:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:36:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:36:34,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 14:36:34,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:34,442 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:36:34,442 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:36:34,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:36:34,443 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:34,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:36:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:36:34,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:34,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:34,462 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:34,462 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:34,463 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:36:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:34,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:34,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:34,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 14:36:34,464 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 14:36:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:34,465 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:36:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:34,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:34,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:34,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:34,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 14:36:34,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 14:36:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:34,467 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 14:36:34,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:36:34,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:34,467 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:34,485 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-27 14:36:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:34,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-27 14:36:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:34,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212598657] [2022-04-27 14:36:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:34,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:34,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215547454] [2022-04-27 14:36:34,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:36:34,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:34,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:34,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:36:34,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:36:34,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:34,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:36:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:35,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#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); {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #60#return; {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret5 := main(); {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#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; {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {2269#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2269#true} {2269#true} #52#return; {2269#true} is VALID [2022-04-27 14:36:35,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {2269#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2307#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:35,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {2307#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2307#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:35,170 INFO L272 TraceCheckUtils]: 13: Hoare triple {2307#(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)); {2269#true} is VALID [2022-04-27 14:36:35,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,171 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2269#true} {2307#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2307#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:35,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {2307#(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; {2329#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:35,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {2329#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2329#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:35,171 INFO L272 TraceCheckUtils]: 20: Hoare triple {2329#(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)); {2269#true} is VALID [2022-04-27 14:36:35,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,172 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2269#true} {2329#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2329#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:35,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {2329#(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; {2351#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:36:35,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {2351#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2351#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:36:35,174 INFO L272 TraceCheckUtils]: 27: Hoare triple {2351#(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)); {2269#true} is VALID [2022-04-27 14:36:35,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2269#true} {2351#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {2351#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:36:35,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {2351#(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; {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:35,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:35,186 INFO L272 TraceCheckUtils]: 34: Hoare triple {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2269#true} is VALID [2022-04-27 14:36:35,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,187 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2269#true} {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #54#return; {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:35,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {2373#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:36:35,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} assume !false; {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:36:35,188 INFO L272 TraceCheckUtils]: 41: Hoare triple {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2269#true} is VALID [2022-04-27 14:36:35,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,189 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2269#true} {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} #54#return; {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:36:35,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {2395#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:36:35,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:36:35,190 INFO L272 TraceCheckUtils]: 48: Hoare triple {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2269#true} is VALID [2022-04-27 14:36:35,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {2269#true} ~cond := #in~cond; {2269#true} is VALID [2022-04-27 14:36:35,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {2269#true} assume !(0 == ~cond); {2269#true} is VALID [2022-04-27 14:36:35,190 INFO L290 TraceCheckUtils]: 51: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-27 14:36:35,191 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2269#true} {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:36:35,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {2417#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2439#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:36:35,193 INFO L272 TraceCheckUtils]: 54: Hoare triple {2439#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:35,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {2443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:35,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {2447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2270#false} is VALID [2022-04-27 14:36:35,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-27 14:36:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:36:35,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:35,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212598657] [2022-04-27 14:36:35,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:35,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215547454] [2022-04-27 14:36:35,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215547454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:35,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:35,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:36:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466180583] [2022-04-27 14:36:35,477 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:35,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:36:35,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:35,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:36:35,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:35,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:36:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:36:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:36:35,507 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:36:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:35,982 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-27 14:36:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:36:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:36:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:36:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:36:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:36:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:36:35,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-27 14:36:36,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:36,028 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:36:36,028 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 14:36:36,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:36:36,029 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:36,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:36:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 14:36:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 14:36:36,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:36,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:36,066 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:36,066 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,068 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:36:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:36:36,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 14:36:36,068 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 14:36:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,069 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:36:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:36:36,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:36,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 14:36:36,071 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 14:36:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:36,071 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 14:36:36,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:36:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:36:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 14:36:36,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:36,072 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:36,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:36,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:36,276 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-27 14:36:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:36,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092891017] [2022-04-27 14:36:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:36,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:36,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214736163] [2022-04-27 14:36:36,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:36:36,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:36,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:36,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:36,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:36:36,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:36:36,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:36,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:36:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:36,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:36,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {2738#true} call ULTIMATE.init(); {2738#true} is VALID [2022-04-27 14:36:36,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2738#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); {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2738#true} {2738#true} #60#return; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {2738#true} call #t~ret5 := main(); {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {2738#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; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {2738#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2738#true} {2738#true} #52#return; {2738#true} is VALID [2022-04-27 14:36:36,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2738#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2776#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:36,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {2776#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2776#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:36,782 INFO L272 TraceCheckUtils]: 13: Hoare triple {2776#(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)); {2738#true} is VALID [2022-04-27 14:36:36,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,782 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2738#true} {2776#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2776#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:36,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2776#(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; {2798#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:36,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {2798#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2798#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:36,783 INFO L272 TraceCheckUtils]: 20: Hoare triple {2798#(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)); {2738#true} is VALID [2022-04-27 14:36:36,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,784 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2738#true} {2798#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2798#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:36,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {2798#(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; {2820#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:36,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {2820#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2820#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:36,785 INFO L272 TraceCheckUtils]: 27: Hoare triple {2820#(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)); {2738#true} is VALID [2022-04-27 14:36:36,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,786 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2738#true} {2820#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2820#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:36,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {2820#(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; {2842#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:36,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {2842#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2842#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:36,786 INFO L272 TraceCheckUtils]: 34: Hoare triple {2842#(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)); {2738#true} is VALID [2022-04-27 14:36:36,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,787 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2738#true} {2842#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {2842#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:36,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {2842#(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; {2864#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:36,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {2864#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2864#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:36,788 INFO L272 TraceCheckUtils]: 41: Hoare triple {2864#(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)); {2738#true} is VALID [2022-04-27 14:36:36,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,789 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2738#true} {2864#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {2864#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:36:36,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {2864#(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; {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:36,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:36,790 INFO L272 TraceCheckUtils]: 48: Hoare triple {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2738#true} is VALID [2022-04-27 14:36:36,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,790 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2738#true} {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:36,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {2886#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 14:36:36,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} assume !false; {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 14:36:36,791 INFO L272 TraceCheckUtils]: 55: Hoare triple {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= 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)); {2738#true} is VALID [2022-04-27 14:36:36,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-27 14:36:36,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-27 14:36:36,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-27 14:36:36,792 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2738#true} {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} #54#return; {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} is VALID [2022-04-27 14:36:36,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {2908#(and (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2930#(and (<= main_~k~0 6) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:36:36,793 INFO L272 TraceCheckUtils]: 61: Hoare triple {2930#(and (<= main_~k~0 6) (< 5 main_~k~0) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2934#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:36,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {2934#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2938#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:36,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {2938#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2739#false} is VALID [2022-04-27 14:36:36,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {2739#false} assume !false; {2739#false} is VALID [2022-04-27 14:36:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:36:36,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092891017] [2022-04-27 14:36:37,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214736163] [2022-04-27 14:36:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214736163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:37,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:37,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:36:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208943589] [2022-04-27 14:36:37,030 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:36:37,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:37,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:36:37,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:37,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:36:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:36:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:36:37,063 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:36:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:37,584 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:36:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:36:37,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:36:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:36:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:36:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:36:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:36:37,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:36:37,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:37,630 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:36:37,630 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 14:36:37,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:36:37,631 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:37,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:36:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 14:36:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 14:36:37,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:37,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:37,659 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:37,659 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:37,661 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:36:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:36:37,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:37,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:37,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 14:36:37,662 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 14:36:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:37,664 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:36:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:36:37,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:37,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:37,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:37,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-27 14:36:37,666 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-27 14:36:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:37,666 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-27 14:36:37,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:36:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:36:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 14:36:37,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:37,668 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:37,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:36:37,869 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 7 times [2022-04-27 14:36:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:37,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327966504] [2022-04-27 14:36:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:37,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064545099] [2022-04-27 14:36:37,881 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:36:37,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:37,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:37,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:37,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 14:36:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:38,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:36:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:38,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:38,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {3245#true} call ULTIMATE.init(); {3245#true} is VALID [2022-04-27 14:36:38,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#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); {3245#true} is VALID [2022-04-27 14:36:38,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3245#true} {3245#true} #60#return; {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {3245#true} call #t~ret5 := main(); {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {3245#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; {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {3245#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3245#true} {3245#true} #52#return; {3245#true} is VALID [2022-04-27 14:36:38,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {3245#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3283#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:38,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {3283#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3283#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:38,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {3283#(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)); {3245#true} is VALID [2022-04-27 14:36:38,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3245#true} {3283#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3283#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:38,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {3283#(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; {3305#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:38,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {3305#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3305#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:38,619 INFO L272 TraceCheckUtils]: 20: Hoare triple {3305#(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)); {3245#true} is VALID [2022-04-27 14:36:38,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,622 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3245#true} {3305#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3305#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:38,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {3305#(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; {3327#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:38,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {3327#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3327#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:38,623 INFO L272 TraceCheckUtils]: 27: Hoare triple {3327#(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)); {3245#true} is VALID [2022-04-27 14:36:38,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,624 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3245#true} {3327#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3327#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:38,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {3327#(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; {3349#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:38,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {3349#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {3349#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:38,625 INFO L272 TraceCheckUtils]: 34: Hoare triple {3349#(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)); {3245#true} is VALID [2022-04-27 14:36:38,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,625 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3245#true} {3349#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {3349#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:38,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {3349#(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; {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:38,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:38,626 INFO L272 TraceCheckUtils]: 41: Hoare triple {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3245#true} is VALID [2022-04-27 14:36:38,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,626 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3245#true} {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:36:38,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {3371#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:38,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:38,627 INFO L272 TraceCheckUtils]: 48: Hoare triple {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 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)); {3245#true} is VALID [2022-04-27 14:36:38,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,627 INFO L290 TraceCheckUtils]: 51: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,628 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3245#true} {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #54#return; {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:38,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {3393#(and (= (+ main_~y~0 (- 3)) 2) (= 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; {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:38,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !false; {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:38,628 INFO L272 TraceCheckUtils]: 55: Hoare triple {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 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)); {3245#true} is VALID [2022-04-27 14:36:38,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,629 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3245#true} {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} #54#return; {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:36:38,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {3415#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 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; {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:38,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} assume !false; {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:38,630 INFO L272 TraceCheckUtils]: 62: Hoare triple {3437#(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)); {3245#true} is VALID [2022-04-27 14:36:38,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {3245#true} ~cond := #in~cond; {3245#true} is VALID [2022-04-27 14:36:38,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {3245#true} assume !(0 == ~cond); {3245#true} is VALID [2022-04-27 14:36:38,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-27 14:36:38,631 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3245#true} {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} #54#return; {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:38,631 INFO L290 TraceCheckUtils]: 67: Hoare triple {3437#(and (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3459#(and (<= main_~k~0 7) (= 2 (+ main_~y~0 (- 5))) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:38,632 INFO L272 TraceCheckUtils]: 68: Hoare triple {3459#(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)); {3463#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:38,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {3463#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3467#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:38,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {3467#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3246#false} is VALID [2022-04-27 14:36:38,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {3246#false} assume !false; {3246#false} is VALID [2022-04-27 14:36:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:36:38,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:38,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327966504] [2022-04-27 14:36:38,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:38,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064545099] [2022-04-27 14:36:38,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064545099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:38,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:38,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:36:38,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166506609] [2022-04-27 14:36:38,905 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:38,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 14:36:38,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:38,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:36:38,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:38,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:36:38,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:36:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:36:38,941 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:36:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,564 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 14:36:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:36:39,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 14:36:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:36:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:36:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:36:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:36:39,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-27 14:36:39,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:39,616 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:36:39,616 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:36:39,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:36:39,617 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:39,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:36:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:36:39,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:39,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:39,636 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:39,636 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,638 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:36:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:36:39,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:39,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:39,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 14:36:39,638 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 14:36:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,639 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:36:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:36:39,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:39,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:39,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:39,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 14:36:39,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-27 14:36:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:39,641 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 14:36:39,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:36:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:36:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 14:36:39,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:39,641 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:39,646 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-27 14:36:39,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:36:39,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 8 times [2022-04-27 14:36:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:39,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964575012] [2022-04-27 14:36:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:39,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121456052] [2022-04-27 14:36:39,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:39,860 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:39,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 14:36:40,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:40,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:40,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:36:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:40,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:40,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {3790#true} call ULTIMATE.init(); {3790#true} is VALID [2022-04-27 14:36:40,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#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); {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3790#true} {3790#true} #60#return; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {3790#true} call #t~ret5 := main(); {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {3790#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; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {3790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3790#true} {3790#true} #52#return; {3790#true} is VALID [2022-04-27 14:36:40,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {3790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:40,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:40,872 INFO L272 TraceCheckUtils]: 13: Hoare triple {3828#(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)); {3790#true} is VALID [2022-04-27 14:36:40,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,872 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3790#true} {3828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:40,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {3828#(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; {3850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:40,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {3850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:40,873 INFO L272 TraceCheckUtils]: 20: Hoare triple {3850#(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)); {3790#true} is VALID [2022-04-27 14:36:40,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,874 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3790#true} {3850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {3850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:40,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {3850#(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; {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:40,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:40,875 INFO L272 TraceCheckUtils]: 27: Hoare triple {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3790#true} is VALID [2022-04-27 14:36:40,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,875 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3790#true} {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:40,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {3872#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3894#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:40,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {3894#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {3894#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:40,876 INFO L272 TraceCheckUtils]: 34: Hoare triple {3894#(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)); {3790#true} is VALID [2022-04-27 14:36:40,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,877 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3790#true} {3894#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {3894#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:36:40,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {3894#(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; {3916#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:40,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {3916#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {3916#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:40,878 INFO L272 TraceCheckUtils]: 41: Hoare triple {3916#(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)); {3790#true} is VALID [2022-04-27 14:36:40,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,878 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3790#true} {3916#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {3916#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:40,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {3916#(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; {3938#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:40,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {3938#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3938#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:40,879 INFO L272 TraceCheckUtils]: 48: Hoare triple {3938#(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)); {3790#true} is VALID [2022-04-27 14:36:40,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,880 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3790#true} {3938#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3938#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:40,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {3938#(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; {3960#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:40,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {3960#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {3960#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:40,881 INFO L272 TraceCheckUtils]: 55: Hoare triple {3960#(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)); {3790#true} is VALID [2022-04-27 14:36:40,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,885 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3790#true} {3960#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {3960#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:40,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {3960#(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; {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:40,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:40,886 INFO L272 TraceCheckUtils]: 62: Hoare triple {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3790#true} is VALID [2022-04-27 14:36:40,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,886 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3790#true} {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:40,887 INFO L290 TraceCheckUtils]: 67: Hoare triple {3982#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:36:40,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:36:40,887 INFO L272 TraceCheckUtils]: 69: Hoare triple {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3790#true} is VALID [2022-04-27 14:36:40,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-27 14:36:40,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-27 14:36:40,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-27 14:36:40,888 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3790#true} {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #54#return; {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:36:40,888 INFO L290 TraceCheckUtils]: 74: Hoare triple {4004#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4026#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-27 14:36:40,889 INFO L272 TraceCheckUtils]: 75: Hoare triple {4026#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:40,889 INFO L290 TraceCheckUtils]: 76: Hoare triple {4030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:40,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {4034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3791#false} is VALID [2022-04-27 14:36:40,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {3791#false} assume !false; {3791#false} is VALID [2022-04-27 14:36:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:36:40,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964575012] [2022-04-27 14:36:41,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121456052] [2022-04-27 14:36:41,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121456052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:41,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:41,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:36:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606291551] [2022-04-27 14:36:41,125 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 14:36:41,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:41,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:36:41,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:41,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:36:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:36:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:36:41,170 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:36:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:41,925 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 14:36:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:36:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 14:36:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:36:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:36:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:36:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:36:41,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-27 14:36:41,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:41,970 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:36:41,970 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 14:36:41,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:36:41,971 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:41,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 14:36:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 14:36:41,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:41,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:41,998 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:41,998 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:42,000 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:36:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:36:42,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:42,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:42,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 14:36:42,000 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 14:36:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:42,001 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:36:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:36:42,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:42,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:42,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:42,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-27 14:36:42,003 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-27 14:36:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:42,003 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-27 14:36:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:36:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:36:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 14:36:42,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:42,003 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:42,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:42,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 14:36:42,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 9 times [2022-04-27 14:36:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:42,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425338627] [2022-04-27 14:36:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:42,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:42,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748919853] [2022-04-27 14:36:42,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:42,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:42,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 14:36:42,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:36:42,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:42,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 14:36:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:42,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:43,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {4373#true} call ULTIMATE.init(); {4373#true} is VALID [2022-04-27 14:36:43,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#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); {4373#true} is VALID [2022-04-27 14:36:43,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4373#true} {4373#true} #60#return; {4373#true} is VALID [2022-04-27 14:36:43,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {4373#true} call #t~ret5 := main(); {4373#true} is VALID [2022-04-27 14:36:43,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {4373#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; {4373#true} is VALID [2022-04-27 14:36:43,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {4373#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4373#true} is VALID [2022-04-27 14:36:43,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4373#true} {4373#true} #52#return; {4373#true} is VALID [2022-04-27 14:36:43,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {4373#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4411#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:43,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {4411#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4411#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:43,051 INFO L272 TraceCheckUtils]: 13: Hoare triple {4411#(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)); {4373#true} is VALID [2022-04-27 14:36:43,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,051 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4373#true} {4411#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4411#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:43,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {4411#(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; {4433#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:43,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {4433#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4433#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:43,052 INFO L272 TraceCheckUtils]: 20: Hoare triple {4433#(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)); {4373#true} is VALID [2022-04-27 14:36:43,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,055 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4373#true} {4433#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {4433#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:43,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {4433#(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; {4455#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:43,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {4455#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4455#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:43,056 INFO L272 TraceCheckUtils]: 27: Hoare triple {4455#(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)); {4373#true} is VALID [2022-04-27 14:36:43,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,057 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4373#true} {4455#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4455#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:43,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {4455#(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; {4477#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:43,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {4477#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4477#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:43,058 INFO L272 TraceCheckUtils]: 34: Hoare triple {4477#(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)); {4373#true} is VALID [2022-04-27 14:36:43,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,058 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4373#true} {4477#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {4477#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:43,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {4477#(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; {4499#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:43,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {4499#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {4499#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:43,059 INFO L272 TraceCheckUtils]: 41: Hoare triple {4499#(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)); {4373#true} is VALID [2022-04-27 14:36:43,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,060 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4373#true} {4499#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {4499#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:43,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {4499#(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; {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:43,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:43,061 INFO L272 TraceCheckUtils]: 48: Hoare triple {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4373#true} is VALID [2022-04-27 14:36:43,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,061 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4373#true} {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:43,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {4521#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4543#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:43,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {4543#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4543#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:43,062 INFO L272 TraceCheckUtils]: 55: Hoare triple {4543#(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)); {4373#true} is VALID [2022-04-27 14:36:43,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,063 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4373#true} {4543#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {4543#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:43,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {4543#(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; {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !false; {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,063 INFO L272 TraceCheckUtils]: 62: Hoare triple {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4373#true} is VALID [2022-04-27 14:36:43,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,064 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4373#true} {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} #54#return; {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {4565#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} assume !false; {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,065 INFO L272 TraceCheckUtils]: 69: Hoare triple {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 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)); {4373#true} is VALID [2022-04-27 14:36:43,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,065 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4373#true} {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} #54#return; {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} is VALID [2022-04-27 14:36:43,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {4587#(and (= main_~y~0 8) (= main_~c~0 8) (< 6 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:43,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:43,066 INFO L272 TraceCheckUtils]: 76: Hoare triple {4609#(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)); {4373#true} is VALID [2022-04-27 14:36:43,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {4373#true} ~cond := #in~cond; {4373#true} is VALID [2022-04-27 14:36:43,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {4373#true} assume !(0 == ~cond); {4373#true} is VALID [2022-04-27 14:36:43,066 INFO L290 TraceCheckUtils]: 79: Hoare triple {4373#true} assume true; {4373#true} is VALID [2022-04-27 14:36:43,067 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4373#true} {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:43,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {4609#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4631#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:36:43,068 INFO L272 TraceCheckUtils]: 82: Hoare triple {4631#(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)); {4635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:43,068 INFO L290 TraceCheckUtils]: 83: Hoare triple {4635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:43,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {4639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4374#false} is VALID [2022-04-27 14:36:43,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {4374#false} assume !false; {4374#false} is VALID [2022-04-27 14:36:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:36:43,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:43,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425338627] [2022-04-27 14:36:43,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:43,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748919853] [2022-04-27 14:36:43,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748919853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:43,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:43,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:36:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542738839] [2022-04-27 14:36:43,443 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:43,444 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 14:36:43,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:43,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:36:43,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:36:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:36:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:36:43,482 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:36:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:44,404 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-27 14:36:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:36:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 14:36:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:36:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:36:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:36:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:36:44,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-27 14:36:44,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:44,455 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:36:44,455 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:36:44,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:36:44,456 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:44,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 393 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:36:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:36:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:36:44,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:44,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:44,479 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:44,480 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:44,482 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:36:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:36:44,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:44,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:44,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 14:36:44,482 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 14:36:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:44,483 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:36:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:36:44,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:44,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:44,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:44,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-27 14:36:44,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-27 14:36:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:44,485 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-27 14:36:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:36:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:36:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:36:44,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:44,486 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:44,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:44,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 14:36:44,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 10 times [2022-04-27 14:36:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:44,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831754809] [2022-04-27 14:36:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:44,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117840743] [2022-04-27 14:36:44,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:36:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:44,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:44,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:44,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 14:36:44,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:36:44,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:44,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:36:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:44,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:45,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5038#true} is VALID [2022-04-27 14:36:45,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#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); {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #60#return; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret5 := main(); {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#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; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {5038#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5038#true} {5038#true} #52#return; {5038#true} is VALID [2022-04-27 14:36:45,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {5038#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5076#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {5076#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5076#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,501 INFO L272 TraceCheckUtils]: 13: Hoare triple {5076#(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)); {5038#true} is VALID [2022-04-27 14:36:45,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,501 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5038#true} {5076#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5076#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {5076#(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; {5098#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:45,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {5098#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5098#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:45,502 INFO L272 TraceCheckUtils]: 20: Hoare triple {5098#(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)); {5038#true} is VALID [2022-04-27 14:36:45,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,503 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5038#true} {5098#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5098#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:45,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {5098#(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; {5120#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {5120#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5120#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,503 INFO L272 TraceCheckUtils]: 27: Hoare triple {5120#(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)); {5038#true} is VALID [2022-04-27 14:36:45,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,504 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5038#true} {5120#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5120#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:45,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {5120#(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; {5142#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {5142#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {5142#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,505 INFO L272 TraceCheckUtils]: 34: Hoare triple {5142#(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)); {5038#true} is VALID [2022-04-27 14:36:45,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,505 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5038#true} {5142#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {5142#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:36:45,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {5142#(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; {5164#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {5164#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5164#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,506 INFO L272 TraceCheckUtils]: 41: Hoare triple {5164#(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)); {5038#true} is VALID [2022-04-27 14:36:45,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,506 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5038#true} {5164#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {5164#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {5164#(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; {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:45,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:45,507 INFO L272 TraceCheckUtils]: 48: Hoare triple {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5038#true} is VALID [2022-04-27 14:36:45,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,508 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5038#true} {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:36:45,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {5186#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,509 INFO L272 TraceCheckUtils]: 55: Hoare triple {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5038#true} is VALID [2022-04-27 14:36:45,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,509 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5038#true} {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {5208#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5230#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {5230#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5230#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,510 INFO L272 TraceCheckUtils]: 62: Hoare triple {5230#(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)); {5038#true} is VALID [2022-04-27 14:36:45,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,510 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5038#true} {5230#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {5230#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:45,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {5230#(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; {5252#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:45,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {5252#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {5252#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:45,511 INFO L272 TraceCheckUtils]: 69: Hoare triple {5252#(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)); {5038#true} is VALID [2022-04-27 14:36:45,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,511 INFO L290 TraceCheckUtils]: 71: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,511 INFO L290 TraceCheckUtils]: 72: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,512 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5038#true} {5252#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {5252#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:45,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {5252#(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; {5274#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {5274#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {5274#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,512 INFO L272 TraceCheckUtils]: 76: Hoare triple {5274#(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)); {5038#true} is VALID [2022-04-27 14:36:45,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,513 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5038#true} {5274#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #54#return; {5274#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:45,513 INFO L290 TraceCheckUtils]: 81: Hoare triple {5274#(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; {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:45,514 INFO L290 TraceCheckUtils]: 82: Hoare triple {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:45,514 INFO L272 TraceCheckUtils]: 83: Hoare triple {5296#(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)); {5038#true} is VALID [2022-04-27 14:36:45,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {5038#true} ~cond := #in~cond; {5038#true} is VALID [2022-04-27 14:36:45,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {5038#true} assume !(0 == ~cond); {5038#true} is VALID [2022-04-27 14:36:45,514 INFO L290 TraceCheckUtils]: 86: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-27 14:36:45,514 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5038#true} {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:45,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {5296#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5318#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:45,515 INFO L272 TraceCheckUtils]: 89: Hoare triple {5318#(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)); {5322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:45,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {5322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:45,516 INFO L290 TraceCheckUtils]: 91: Hoare triple {5326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5039#false} is VALID [2022-04-27 14:36:45,516 INFO L290 TraceCheckUtils]: 92: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-27 14:36:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:36:45,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831754809] [2022-04-27 14:36:45,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117840743] [2022-04-27 14:36:45,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117840743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:45,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:36:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956957354] [2022-04-27 14:36:45,792 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 14:36:45,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:45,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:36:45,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:45,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:36:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:36:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:36:45,833 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:36:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:46,867 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:36:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:36:46,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 14:36:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:36:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:36:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:36:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:36:46,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-27 14:36:46,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:46,922 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:36:46,922 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:36:46,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:36:46,923 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:46,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:36:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:36:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 14:36:46,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:46,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:46,946 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:46,946 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:46,947 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:36:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:36:46,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:46,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:46,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 14:36:46,948 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 14:36:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:46,949 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:36:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:36:46,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:46,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:46,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:46,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 14:36:46,951 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-27 14:36:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:46,951 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 14:36:46,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:36:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:36:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 14:36:46,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:46,952 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:46,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:47,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 14:36:47,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 11 times [2022-04-27 14:36:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:47,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105222539] [2022-04-27 14:36:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:47,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:47,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305007651] [2022-04-27 14:36:47,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:36:47,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:47,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:47,178 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:47,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 14:36:47,231 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:36:47,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:47,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 14:36:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:47,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:47,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {5697#true} call ULTIMATE.init(); {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {5697#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); {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5697#true} {5697#true} #60#return; {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {5697#true} call #t~ret5 := main(); {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {5697#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; {5697#true} is VALID [2022-04-27 14:36:47,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {5697#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {5697#true} ~cond := #in~cond; {5723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:36:47,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:36:47,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {5727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:36:47,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5727#(not (= |assume_abort_if_not_#in~cond| 0))} {5697#true} #52#return; {5734#(and (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {5734#(and (<= main_~k~0 10) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:47,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:47,905 INFO L272 TraceCheckUtils]: 13: Hoare triple {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,906 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5697#true} {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:36:47,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {5738#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5760#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {5760#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {5760#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,907 INFO L272 TraceCheckUtils]: 20: Hoare triple {5760#(and (<= 1 main_~c~0) (<= main_~k~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)); {5697#true} is VALID [2022-04-27 14:36:47,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,908 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5697#true} {5760#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {5760#(and (<= 1 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {5760#(and (<= 1 main_~c~0) (<= main_~k~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; {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:36:47,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:36:47,909 INFO L272 TraceCheckUtils]: 27: Hoare triple {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,910 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5697#true} {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:36:47,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {5782#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:36:47,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:36:47,910 INFO L272 TraceCheckUtils]: 34: Hoare triple {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,911 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5697#true} {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:36:47,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {5804#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:36:47,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:36:47,912 INFO L272 TraceCheckUtils]: 41: Hoare triple {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,913 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5697#true} {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:36:47,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {5826#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:36:47,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:36:47,914 INFO L272 TraceCheckUtils]: 48: Hoare triple {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,914 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5697#true} {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:36:47,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {5848#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:36:47,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !false; {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:36:47,915 INFO L272 TraceCheckUtils]: 55: Hoare triple {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,930 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5697#true} {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} #54#return; {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} is VALID [2022-04-27 14:36:47,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {5870#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 6 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:36:47,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !false; {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:36:47,931 INFO L272 TraceCheckUtils]: 62: Hoare triple {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,931 INFO L290 TraceCheckUtils]: 63: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,931 INFO L290 TraceCheckUtils]: 64: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,932 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5697#true} {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} #54#return; {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} is VALID [2022-04-27 14:36:47,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {5892#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:36:47,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !false; {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:36:47,933 INFO L272 TraceCheckUtils]: 69: Hoare triple {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5697#true} is VALID [2022-04-27 14:36:47,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,934 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5697#true} {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} #54#return; {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} is VALID [2022-04-27 14:36:47,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {5914#(and (<= main_~k~0 10) (<= 0 main_~k~0) (<= 8 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5936#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {5936#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {5936#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,935 INFO L272 TraceCheckUtils]: 76: Hoare triple {5936#(and (<= 9 main_~c~0) (<= main_~k~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)); {5697#true} is VALID [2022-04-27 14:36:47,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,936 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5697#true} {5936#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {5936#(and (<= 9 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {5936#(and (<= 9 main_~c~0) (<= main_~k~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; {5958#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {5958#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} assume !false; {5958#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,937 INFO L272 TraceCheckUtils]: 83: Hoare triple {5958#(and (<= 10 main_~c~0) (<= main_~k~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)); {5697#true} is VALID [2022-04-27 14:36:47,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {5697#true} ~cond := #in~cond; {5697#true} is VALID [2022-04-27 14:36:47,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {5697#true} assume !(0 == ~cond); {5697#true} is VALID [2022-04-27 14:36:47,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {5697#true} assume true; {5697#true} is VALID [2022-04-27 14:36:47,938 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5697#true} {5958#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} #54#return; {5958#(and (<= 10 main_~c~0) (<= main_~k~0 10) (<= 0 main_~k~0))} is VALID [2022-04-27 14:36:47,938 INFO L290 TraceCheckUtils]: 88: Hoare triple {5958#(and (<= 10 main_~c~0) (<= main_~k~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; {5698#false} is VALID [2022-04-27 14:36:47,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {5698#false} assume !false; {5698#false} is VALID [2022-04-27 14:36:47,938 INFO L272 TraceCheckUtils]: 90: Hoare triple {5698#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5698#false} is VALID [2022-04-27 14:36:47,938 INFO L290 TraceCheckUtils]: 91: Hoare triple {5698#false} ~cond := #in~cond; {5698#false} is VALID [2022-04-27 14:36:47,938 INFO L290 TraceCheckUtils]: 92: Hoare triple {5698#false} assume !(0 == ~cond); {5698#false} is VALID [2022-04-27 14:36:47,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {5698#false} assume true; {5698#false} is VALID [2022-04-27 14:36:47,939 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {5698#false} {5698#false} #54#return; {5698#false} is VALID [2022-04-27 14:36:47,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {5698#false} assume !(~c~0 < ~k~0); {5698#false} is VALID [2022-04-27 14:36:47,949 INFO L272 TraceCheckUtils]: 96: Hoare triple {5698#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5698#false} is VALID [2022-04-27 14:36:47,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {5698#false} ~cond := #in~cond; {5698#false} is VALID [2022-04-27 14:36:47,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {5698#false} assume 0 == ~cond; {5698#false} is VALID [2022-04-27 14:36:47,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {5698#false} assume !false; {5698#false} is VALID [2022-04-27 14:36:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 14:36:47,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:36:47,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105222539] [2022-04-27 14:36:47,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305007651] [2022-04-27 14:36:47,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305007651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:47,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:47,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-27 14:36:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871513823] [2022-04-27 14:36:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:47,951 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 14:36:47,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:47,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:36:47,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:47,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:36:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:36:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:36:47,995 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:36:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:48,331 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-27 14:36:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:36:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 14:36:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:36:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-27 14:36:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:36:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-27 14:36:48,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-27 14:36:48,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:48,381 INFO L225 Difference]: With dead ends: 65 [2022-04-27 14:36:48,381 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:36:48,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:36:48,382 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:48,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 178 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:36:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:36:48,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:48,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:36:48,383 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:36:48,383 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:36:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:48,383 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:36:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:48,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:48,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:48,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:36:48,383 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:36:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:48,383 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:36:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:48,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:48,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:48,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:48,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:36:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:36:48,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2022-04-27 14:36:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:48,384 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:36:48,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:36:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:36:48,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:48,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:36:48,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 14:36:48,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 14:36:48,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:36:49,173 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:36:49,173 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:36:49,173 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-27 14:36:49,174 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 1) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 1)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 9) (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)))) [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and (= main_~y~0 6) .cse0 (= main_~c~0 6) (< 5 main_~k~0) .cse1) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= 10 main_~c~0) .cse0 (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse1) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and (= 7 main_~y~0) .cse0 (= 7 main_~c~0) .cse1 (< 6 main_~k~0)) (and .cse0 (= 5 main_~c~0) (= 5 main_~y~0) .cse1 (< 4 main_~k~0)) (and .cse0 (= main_~y~0 1) .cse1 (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 1)) (and (< 7 main_~k~0) .cse0 (= main_~y~0 8) (= main_~c~0 8) .cse1) (and .cse0 (= main_~y~0 9) (= main_~c~0 9) (< 8 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)))) [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse2 (+ (- 2) main_~y~0)) (.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0) .cse0) (and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0) (<= main_~c~0 9) .cse0) (and (< 1 main_~k~0) (= .cse1 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~k~0 6) (< 5 main_~k~0) (= .cse2 4) .cse0 (<= main_~c~0 6)) (and (= .cse1 0) (<= main_~k~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~k~0 7) (<= main_~c~0 7) (= 2 (+ main_~y~0 (- 5))) .cse0 (< 6 main_~k~0)) (and (<= main_~k~0 10) (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0) .cse0) (and (< 7 main_~k~0) (<= main_~c~0 8) (= .cse2 6) (<= main_~k~0 8) .cse0))) [2022-04-27 14:36:49,174 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 14:36:49,174 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-27 14:36:49,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:36:49,175 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:36:49,175 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:36:49,177 INFO L356 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2022-04-27 14:36:49,178 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:36:49,188 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:36:49,188 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:36:49,189 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:36:49,190 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:36:49,190 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:36:49,190 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:36:49,190 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:36:49,190 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:36:49,199 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:36:49,200 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:36:49,200 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:36:49,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:36:49 BoogieIcfgContainer [2022-04-27 14:36:49,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:36:49,213 INFO L158 Benchmark]: Toolchain (without parser) took 21914.87ms. Allocated memory was 194.0MB in the beginning and 289.4MB in the end (delta: 95.4MB). Free memory was 144.0MB in the beginning and 152.4MB in the end (delta: -8.4MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-04-27 14:36:49,213 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 194.0MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:36:49,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.57ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 169.1MB in the end (delta: -25.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 14:36:49,213 INFO L158 Benchmark]: Boogie Preprocessor took 18.75ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:36:49,214 INFO L158 Benchmark]: RCFGBuilder took 227.90ms. Allocated memory is still 194.0MB. Free memory was 167.6MB in the beginning and 156.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:36:49,214 INFO L158 Benchmark]: TraceAbstraction took 21447.37ms. Allocated memory was 194.0MB in the beginning and 289.4MB in the end (delta: 95.4MB). Free memory was 156.5MB in the beginning and 152.4MB in the end (delta: 4.1MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2022-04-27 14:36:49,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 194.0MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.57ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 169.1MB in the end (delta: -25.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.75ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.90ms. Allocated memory is still 194.0MB. Free memory was 167.6MB in the beginning and 156.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21447.37ms. Allocated memory was 194.0MB in the beginning and 289.4MB in the end (delta: 95.4MB). Free memory was 156.5MB in the beginning and 152.4MB in the end (delta: 4.1MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 2999 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2499 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2552 IncrementalHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 500 mSDtfsCounter, 2552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 774 SyntacticMatches, 12 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=13, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 39 PreInvPairs, 74 NumberOfFragments, 1088 HoareAnnotationTreeSize, 39 FomulaSimplifications, 474 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 773 NumberOfCodeBlocks, 769 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2079 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1502/2164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((k <= 10 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) || ((((y == 6 && k <= 10) && c == 6) && 5 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((10 <= c && k <= 10) && y == 10) && c <= 10) && 9 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((y == 2 && k <= 10) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((7 == y && k <= 10) && 7 == c) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 6 < k)) || ((((k <= 10 && 5 == c) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 4 < k)) || ((((k <= 10 && y == 1) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c < k + 1) && c == 1)) || ((((7 < k && k <= 10) && y == 8) && c == 8) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 9) && c == 9) && 8 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 10 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:36:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...