/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/ps6-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:54:07,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:54:07,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:54:07,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:54:07,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:54:07,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:54:07,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:54:07,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:54:07,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:54:07,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:54:07,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:54:07,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:54:07,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:54:07,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:54:07,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:54:07,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:54:07,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:54:07,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:54:07,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:54:07,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:54:07,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:54:07,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:54:07,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:54:07,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:54:07,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:54:07,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:54:07,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:54:07,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:54:07,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:54:07,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:54:07,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:54:07,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:54:07,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:54:07,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:54:07,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:54:07,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:54:07,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:54:07,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:54:07,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:54:07,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:54:07,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:54:07,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:54:07,774 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:54:07,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:54:07,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:54:07,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:54:07,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:54:07,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:54:07,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:54:07,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:54:07,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:54:07,802 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:54:07,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:54:07,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:54:07,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:54:07,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:54:07,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:54:07,805 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:54:07,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:54:07,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:54:07,805 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:54:07,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:54:08,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:54:08,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:54:08,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:54:08,003 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:54:08,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2022-04-27 14:54:08,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59588ba6/aeb9a1561242498a8cf155211df465af/FLAGc1b060316 [2022-04-27 14:54:08,403 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:54:08,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2022-04-27 14:54:08,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59588ba6/aeb9a1561242498a8cf155211df465af/FLAGc1b060316 [2022-04-27 14:54:08,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59588ba6/aeb9a1561242498a8cf155211df465af [2022-04-27 14:54:08,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:54:08,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:54:08,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:54:08,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:54:08,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:54:08,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f50cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08, skipping insertion in model container [2022-04-27 14:54:08,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:54:08,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:54:08,584 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/ps6-ll_valuebound5.c[458,471] [2022-04-27 14:54:08,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:54:08,607 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:54:08,616 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/ps6-ll_valuebound5.c[458,471] [2022-04-27 14:54:08,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:54:08,631 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:54:08,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08 WrapperNode [2022-04-27 14:54:08,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:54:08,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:54:08,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:54:08,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:54:08,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:54:08,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:54:08,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:54:08,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:54:08,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (1/1) ... [2022-04-27 14:54:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:54:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:08,705 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:54:08,714 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:54:08,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:54:08,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:54:08,731 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:54:08,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:54:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:54:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:54:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:54:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:54:08,780 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:54:08,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:54:08,913 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:54:08,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:54:08,919 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:54:08,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:54:08 BoogieIcfgContainer [2022-04-27 14:54:08,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:54:08,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:54:08,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:54:08,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:54:08,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:54:08" (1/3) ... [2022-04-27 14:54:08,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a619761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:54:08, skipping insertion in model container [2022-04-27 14:54:08,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:54:08" (2/3) ... [2022-04-27 14:54:08,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a619761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:54:08, skipping insertion in model container [2022-04-27 14:54:08,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:54:08" (3/3) ... [2022-04-27 14:54:08,925 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2022-04-27 14:54:08,941 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:54:08,941 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:54:08,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:54:08,975 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@430551da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d84ecca [2022-04-27 14:54:08,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:54:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:54:08,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:08,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:08,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:54:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612668927] [2022-04-27 14:54:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:54:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:09,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {32#true} is VALID [2022-04-27 14:54:09,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:54:09,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:54:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:54:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:09,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:09,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:09,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:09,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:54:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:54:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:09,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:09,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:09,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:54:09,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:54:09,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {32#true} is VALID [2022-04-27 14:54:09,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:54:09,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:54:09,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:54:09,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-27 14:54:09,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-27 14:54:09,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:09,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:09,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:09,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:54:09,259 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:54:09,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:54:09,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:54:09,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:54:09,261 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:54:09,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:54:09,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:54:09,262 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:54:09,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:54:09,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:54:09,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:54:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612668927] [2022-04-27 14:54:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612668927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:54:09,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:54:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:54:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387828769] [2022-04-27 14:54:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:09,269 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:54:09,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:09,273 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:09,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:09,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:54:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:54:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:54:09,324 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:09,704 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:54:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:54:09,705 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:54:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:09,706 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:54:09,720 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:54:09,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:54:09,819 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:54:09,824 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:54:09,825 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:54:09,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:54:09,829 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:09,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:54:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:54:09,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:09,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:09,872 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:09,893 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:09,907 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:54:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:09,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:09,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:09,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:54:09,909 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:54:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:09,913 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:54:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:09,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:09,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:09,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:09,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:54:09,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:54:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:09,920 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:54:09,921 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:54:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:54:09,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:09,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:54:09,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:54:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:09,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348724071] [2022-04-27 14:54:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:09,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087995875] [2022-04-27 14:54:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:09,959 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:54:09,975 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:54:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:10,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:54:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:10,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:10,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:54:10,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#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); {202#true} is VALID [2022-04-27 14:54:10,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:10,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:54:10,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:54:10,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#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; {202#true} is VALID [2022-04-27 14:54:10,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {202#true} is VALID [2022-04-27 14:54:10,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:54:10,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:54:10,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:10,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:54:10,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:54:10,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:54:10,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:54:10,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:54:10,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:54:10,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:10,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:10,180 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:10,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:10,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:54:10,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:54:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:10,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:54:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348724071] [2022-04-27 14:54:10,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087995875] [2022-04-27 14:54:10,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087995875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:54:10,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:54:10,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:54:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619088557] [2022-04-27 14:54:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:10,185 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:54:10,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:10,185 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:10,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:10,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:54:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:10,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:54:10,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:54:10,204 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:10,427 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:54:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:10,428 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:54:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:10,428 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:54:10,430 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:54:10,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:54:10,465 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:54:10,466 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:54:10,467 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:54:10,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:54:10,468 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 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:54:10,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:54:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:54:10,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:10,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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:54:10,474 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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:54:10,474 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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:54:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:10,475 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:54:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:10,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:10,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:10,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-27 14:54:10,476 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-27 14:54:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:10,478 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:54:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:10,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:10,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:10,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:10,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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:54:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:54:10,480 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:54:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:10,481 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:54:10,481 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:54:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:54:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:54:10,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:10,482 INFO L195 NwaCegarLoop]: trace histogram [2, 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:54:10,498 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:54:10,685 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:54:10,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:54:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:10,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293072309] [2022-04-27 14:54:10,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:10,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:10,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394718707] [2022-04-27 14:54:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:10,700 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:54:10,701 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:54:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:10,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:54:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:10,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:10,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:54:10,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:54:10,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:10,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:54:10,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:54:10,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:10,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:54:10,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:10,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:10,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:54:10,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:10,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:10,915 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:10,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:10,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:10,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:10,916 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:10,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(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 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:54:10,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:54:10,918 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:10,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:10,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:54:10,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:54:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:54:10,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:11,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:54:11,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:54:11,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:11,113 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:11,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:15,288 WARN L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 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 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is UNKNOWN [2022-04-27 14:54:15,300 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:15,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:15,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:15,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:15,301 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:15,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:15,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:54:15,309 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:54:15,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:15,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:15,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:15,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:15,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:54:15,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:15,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:54:15,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:54:15,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {434#true} is VALID [2022-04-27 14:54:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:54:15,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:54:15,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:54:15,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:54:15,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:54:15,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:54:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:54:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:15,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293072309] [2022-04-27 14:54:15,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:15,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394718707] [2022-04-27 14:54:15,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394718707] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:15,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:15,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:54:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836485455] [2022-04-27 14:54:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:15,312 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:54:15,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:15,313 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:19,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:19,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:54:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:19,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:54:19,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:54:19,390 INFO L87 Difference]: Start difference. First operand 31 states and 34 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:19,493 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:54:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:19,493 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:54:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:19,493 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:19,494 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:19,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:54:23,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:23,546 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:54:23,546 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:54:23,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:54:23,548 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:23,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:54:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:54:23,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:23,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:54:23,553 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:54:23,553 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:54:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:23,555 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:54:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:23,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:23,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:23,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-27 14:54:23,557 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-27 14:54:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:23,559 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:54:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:23,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:23,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:23,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:23,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:54:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:54:23,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:54:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:23,561 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:54:23,561 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:54:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:54:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:54:23,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:23,562 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 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:54:23,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:54:23,766 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:54:23,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:54:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:23,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006965371] [2022-04-27 14:54:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:23,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:23,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324743389] [2022-04-27 14:54:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:23,787 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:54:23,790 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:54:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:23,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:54:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:23,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:24,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:54:24,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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); {784#true} is VALID [2022-04-27 14:54:24,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:54:24,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#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; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:24,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:24,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:54:24,071 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:24,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:24,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:24,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:54:24,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:24,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:24,073 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:24,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:24,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:24,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,073 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:24,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(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 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:24,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:24,074 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:24,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:24,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:24,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,075 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:24,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:24,076 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:54:24,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:54:24,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:54:24,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:54:24,077 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:24,077 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:24,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:24,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:54:24,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:54:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:54:24,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:24,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006965371] [2022-04-27 14:54:24,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:24,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324743389] [2022-04-27 14:54:24,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324743389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:24,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:24,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:54:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527733867] [2022-04-27 14:54:24,335 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:24,335 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:54:24,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:24,336 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:24,356 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:54:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:54:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:54:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:54:24,357 INFO L87 Difference]: Start difference. First operand 33 states and 35 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:24,539 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:54:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:54:24,540 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:54:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:24,540 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:54:24,541 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:54:24,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:54:24,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:24,573 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:54:24,573 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:54:24,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 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:54:24,574 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:24,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:54:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:54:24,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:24,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:54:24,588 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:54:24,588 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:54:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:24,590 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:54:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:24,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:24,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:24,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 36 states. [2022-04-27 14:54:24,591 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 36 states. [2022-04-27 14:54:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:24,592 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:54:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:24,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:24,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:24,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:24,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:54:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:54:24,594 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:54:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:24,594 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:54:24,594 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:54:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:54:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:54:24,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:24,599 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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:54:24,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 14:54:24,807 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:54:24,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:54:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541966937] [2022-04-27 14:54:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:24,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:24,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989327495] [2022-04-27 14:54:24,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:54:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:24,824 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:54:24,825 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:54:24,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:54:24,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:24,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:54:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:24,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:25,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:54:25,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#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); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#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; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:25,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,428 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:54:25,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:25,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:25,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:25,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:25,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,429 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:25,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (<= 0 main_~x~0) (= 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 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:25,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:25,431 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:25,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:25,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,434 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:25,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~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 * ~y~0 * ~y~0 + ~x~0; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} is VALID [2022-04-27 14:54:25,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} assume !false; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} is VALID [2022-04-27 14:54:25,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:54:25,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:54:25,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:54:25,437 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} #57#return; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} is VALID [2022-04-27 14:54:25,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} assume !(~c~0 < ~k~0); {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} is VALID [2022-04-27 14:54:25,437 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:54:25,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1286#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:25,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {1286#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:25,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:54:25,439 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= (+ (* 5 main_~y~0) (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 1)))} #59#return; {1297#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:54:25,440 INFO L272 TraceCheckUtils]: 43: Hoare triple {1297#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:25,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {1301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:25,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {1305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:54:25,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:54:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 14:54:25,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541966937] [2022-04-27 14:54:59,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989327495] [2022-04-27 14:54:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989327495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:59,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:59,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:54:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941269350] [2022-04-27 14:54:59,999 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:59,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:54:59,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:00,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:55:00,031 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:55:00,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:55:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:55:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=217, Unknown=1, NotChecked=0, Total=272 [2022-04-27 14:55:00,032 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:55:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:00,522 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:55:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:55:00,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:55:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:55:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-27 14:55:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:55:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-27 14:55:00,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-27 14:55:00,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:00,560 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:55:00,560 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:55:00,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2022-04-27 14:55:00,561 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:00,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 159 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:55:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:55:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:55:00,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:00,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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:55:00,576 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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:55:00,576 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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:55:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:00,577 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:55:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:55:00,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:00,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:00,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 39 states. [2022-04-27 14:55:00,578 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 39 states. [2022-04-27 14:55:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:00,579 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:55:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:55:00,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:00,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:00,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:00,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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:55:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:55:00,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:55:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:00,581 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:55:00,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:55:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:55:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:55:00,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:00,582 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:00,786 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:55:00,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:55:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:00,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966496419] [2022-04-27 14:55:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:00,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510276695] [2022-04-27 14:55:00,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:55:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:00,801 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:55:00,813 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:55:00,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:55:00,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:00,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:55:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:00,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:01,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {1603#true} call ULTIMATE.init(); {1603#true} is VALID [2022-04-27 14:55:01,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#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); {1603#true} is VALID [2022-04-27 14:55:01,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1603#true} {1603#true} #63#return; {1603#true} is VALID [2022-04-27 14:55:01,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1603#true} call #t~ret5 := main(); {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {1603#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; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {1603#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1603#true} {1603#true} #53#return; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L272 TraceCheckUtils]: 11: Hoare triple {1603#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,214 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1603#true} {1603#true} #55#return; {1603#true} is VALID [2022-04-27 14:55:01,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {1603#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1656#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {1656#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,225 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1603#true} {1656#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1656#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {1656#(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 * ~y~0 * ~y~0 + ~x~0; {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:01,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:01,225 INFO L272 TraceCheckUtils]: 25: Hoare triple {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,226 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1603#true} {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1678#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:01,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {1678#(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 * ~y~0 * ~y~0 + ~x~0; {1700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {1700#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {1700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,227 INFO L272 TraceCheckUtils]: 32: Hoare triple {1700#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,228 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1603#true} {1700#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {1700#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(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 * ~y~0 * ~y~0 + ~x~0; {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:55:01,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !false; {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:55:01,229 INFO L272 TraceCheckUtils]: 39: Hoare triple {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,233 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1603#true} {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #57#return; {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:55:01,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {1722#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1744#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:55:01,234 INFO L272 TraceCheckUtils]: 45: Hoare triple {1744#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1603#true} is VALID [2022-04-27 14:55:01,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {1603#true} ~cond := #in~cond; {1603#true} is VALID [2022-04-27 14:55:01,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {1603#true} assume !(0 == ~cond); {1603#true} is VALID [2022-04-27 14:55:01,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {1603#true} assume true; {1603#true} is VALID [2022-04-27 14:55:01,234 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1603#true} {1744#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1744#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:55:01,235 INFO L272 TraceCheckUtils]: 50: Hoare triple {1744#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:01,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {1763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:01,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {1767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1604#false} is VALID [2022-04-27 14:55:01,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {1604#false} assume !false; {1604#false} is VALID [2022-04-27 14:55:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:55:01,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:01,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966496419] [2022-04-27 14:55:01,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:01,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510276695] [2022-04-27 14:55:01,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510276695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:01,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:01,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:55:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048615568] [2022-04-27 14:55:01,471 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:01,472 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:55:01,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:01,472 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:55:01,500 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:55:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:55:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:55:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:55:01,501 INFO L87 Difference]: Start difference. First operand 39 states and 43 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:55:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:01,821 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:55:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:55:01,822 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:55:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:01,822 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:55:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:55:01,823 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:55:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:55:01,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:55:01,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:01,859 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:55:01,859 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:55:01,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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:55:01,860 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:01,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:55:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:55:01,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:01,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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:55:01,873 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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:55:01,873 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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:55:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:01,875 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:55:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:55:01,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:01,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:01,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 42 states. [2022-04-27 14:55:01,875 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 42 states. [2022-04-27 14:55:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:01,876 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:55:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:55:01,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:01,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:01,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:01,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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:55:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:55:01,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:55:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:01,878 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:55:01,878 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:55:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:55:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:55:01,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:01,879 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:01,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 14:55:02,083 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:55:02,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:55:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:02,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783038202] [2022-04-27 14:55:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:02,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:02,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108891798] [2022-04-27 14:55:02,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:55:02,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:02,099 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:55:02,117 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:55:02,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:55:02,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:02,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:55:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:02,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:02,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2022-04-27 14:55:02,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#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); {2055#true} is VALID [2022-04-27 14:55:02,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #63#return; {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret5 := main(); {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {2055#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; {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {2055#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2055#true} {2055#true} #53#return; {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {2055#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2055#true} {2055#true} #55#return; {2055#true} is VALID [2022-04-27 14:55:02,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {2055#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:02,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {2108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:02,457 INFO L272 TraceCheckUtils]: 18: Hoare triple {2108#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,457 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2055#true} {2108#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:02,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {2108#(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 * ~y~0 * ~y~0 + ~x~0; {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:02,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:02,458 INFO L272 TraceCheckUtils]: 25: Hoare triple {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,458 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2055#true} {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2130#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:02,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {2130#(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 * ~y~0 * ~y~0 + ~x~0; {2152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:02,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {2152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:02,459 INFO L272 TraceCheckUtils]: 32: Hoare triple {2152#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,460 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2055#true} {2152#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {2152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:02,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {2152#(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 * ~y~0 * ~y~0 + ~x~0; {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:55:02,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:55:02,460 INFO L272 TraceCheckUtils]: 39: Hoare triple {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,461 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2055#true} {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:55:02,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {2174#(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 * ~y~0 * ~y~0 + ~x~0; {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 14:55:02,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !false; {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 14:55:02,462 INFO L272 TraceCheckUtils]: 46: Hoare triple {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,463 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2055#true} {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #57#return; {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 14:55:02,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {2196#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2218#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:55:02,464 INFO L272 TraceCheckUtils]: 52: Hoare triple {2218#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2055#true} is VALID [2022-04-27 14:55:02,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {2055#true} ~cond := #in~cond; {2055#true} is VALID [2022-04-27 14:55:02,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {2055#true} assume !(0 == ~cond); {2055#true} is VALID [2022-04-27 14:55:02,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-27 14:55:02,464 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2055#true} {2218#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} #59#return; {2218#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:55:02,465 INFO L272 TraceCheckUtils]: 57: Hoare triple {2218#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2237#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:02,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {2237#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2241#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:02,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {2241#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2056#false} is VALID [2022-04-27 14:55:02,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2022-04-27 14:55:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:55:02,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783038202] [2022-04-27 14:55:02,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108891798] [2022-04-27 14:55:02,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108891798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:02,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:02,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:55:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416012631] [2022-04-27 14:55:02,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:02,739 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:55:02,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:02,739 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:55:02,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:02,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:55:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:02,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:55:02,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:55:02,775 INFO L87 Difference]: Start difference. First operand 42 states and 47 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:55:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:03,186 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:55:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:55:03,192 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:55:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:03,194 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:55:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:55:03,197 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:55:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:55:03,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:55:03,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:03,239 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:55:03,239 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:55:03,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:55:03,240 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:03,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:55:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:55:03,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:03,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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:55:03,261 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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:55:03,261 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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:55:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:03,262 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:55:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:55:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:03,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 45 states. [2022-04-27 14:55:03,263 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 45 states. [2022-04-27 14:55:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:03,264 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:55:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:55:03,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:03,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:03,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:03,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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:55:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:55:03,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:55:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:03,266 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:55:03,266 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:55:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:55:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:55:03,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:03,267 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:03,282 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:55:03,475 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:55:03,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:55:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:03,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405423247] [2022-04-27 14:55:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:03,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:03,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981536044] [2022-04-27 14:55:03,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:55:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:03,488 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:55:03,489 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:55:03,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:55:03,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:03,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:55:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:04,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:04,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2545#true} call ULTIMATE.init(); {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2545#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); {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2545#true} {2545#true} #63#return; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {2545#true} call #t~ret5 := main(); {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {2545#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; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {2545#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2545#true} {2545#true} #53#return; {2545#true} is VALID [2022-04-27 14:55:04,348 INFO L272 TraceCheckUtils]: 11: Hoare triple {2545#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,353 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2545#true} {2545#true} #55#return; {2545#true} is VALID [2022-04-27 14:55:04,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {2545#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2598#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2598#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,354 INFO L272 TraceCheckUtils]: 18: Hoare triple {2598#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,354 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2545#true} {2598#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2598#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#(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 * ~y~0 * ~y~0 + ~x~0; {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:04,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:04,355 INFO L272 TraceCheckUtils]: 25: Hoare triple {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,355 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2545#true} {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2620#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:04,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {2620#(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 * ~y~0 * ~y~0 + ~x~0; {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:04,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:04,356 INFO L272 TraceCheckUtils]: 32: Hoare triple {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,357 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2545#true} {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:04,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {2642#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,357 INFO L272 TraceCheckUtils]: 39: Hoare triple {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,358 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2545#true} {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {2664#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:04,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:04,358 INFO L272 TraceCheckUtils]: 46: Hoare triple {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,359 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2545#true} {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #57#return; {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:04,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {2686#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:55:04,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:55:04,360 INFO L272 TraceCheckUtils]: 53: Hoare triple {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,363 INFO L290 TraceCheckUtils]: 56: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,364 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2545#true} {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:55:04,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {2708#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2730#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:55:04,364 INFO L272 TraceCheckUtils]: 59: Hoare triple {2730#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2545#true} is VALID [2022-04-27 14:55:04,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {2545#true} ~cond := #in~cond; {2545#true} is VALID [2022-04-27 14:55:04,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {2545#true} assume !(0 == ~cond); {2545#true} is VALID [2022-04-27 14:55:04,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {2545#true} assume true; {2545#true} is VALID [2022-04-27 14:55:04,365 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2545#true} {2730#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {2730#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:55:04,366 INFO L272 TraceCheckUtils]: 64: Hoare triple {2730#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:04,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {2749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:04,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {2753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2546#false} is VALID [2022-04-27 14:55:04,367 INFO L290 TraceCheckUtils]: 67: Hoare triple {2546#false} assume !false; {2546#false} is VALID [2022-04-27 14:55:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:55:04,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405423247] [2022-04-27 14:55:04,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981536044] [2022-04-27 14:55:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981536044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:04,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:55:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377381363] [2022-04-27 14:55:04,605 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:04,605 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:55:04,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:04,605 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:55:04,640 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:55:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:55:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:55:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:55:04,641 INFO L87 Difference]: Start difference. First operand 45 states and 51 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:55:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:05,134 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:55:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:55:05,134 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:55:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:05,134 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:55:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:55:05,135 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:55:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:55:05,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:55:05,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:05,178 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:55:05,178 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:55:05,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 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:55:05,179 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:05,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:55:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:55:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:55:05,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:05,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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:55:05,201 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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:55:05,201 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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:55:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:05,202 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:55:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:55:05,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:05,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:05,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 48 states. [2022-04-27 14:55:05,203 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 48 states. [2022-04-27 14:55:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:05,204 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:55:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:55:05,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:05,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:05,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:05,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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:55:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:55:05,205 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:55:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:05,206 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:55:05,206 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:55:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:55:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:55:05,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:05,207 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:05,212 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:55:05,411 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:55:05,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:55:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:05,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15714807] [2022-04-27 14:55:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:05,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:05,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656374020] [2022-04-27 14:55:05,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:55:05,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:05,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:05,433 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:55:05,434 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:55:05,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:55:05,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:05,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:55:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:05,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:06,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {3073#true} call ULTIMATE.init(); {3073#true} is VALID [2022-04-27 14:55:06,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {3073#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); {3073#true} is VALID [2022-04-27 14:55:06,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3073#true} {3073#true} #63#return; {3073#true} is VALID [2022-04-27 14:55:06,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {3073#true} call #t~ret5 := main(); {3073#true} is VALID [2022-04-27 14:55:06,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {3073#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; {3073#true} is VALID [2022-04-27 14:55:06,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {3073#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {3073#true} ~cond := #in~cond; {3099#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:55:06,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {3099#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3103#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:55:06,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3103#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:55:06,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3103#(not (= |assume_abort_if_not_#in~cond| 0))} {3073#true} #53#return; {3110#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-27 14:55:06,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~k~0 5) (<= 0 main_~k~0))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3073#true} {3110#(and (<= main_~k~0 5) (<= 0 main_~k~0))} #55#return; {3110#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-27 14:55:06,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {3110#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:55:06,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:55:06,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,224 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3073#true} {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #57#return; {3129#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:55:06,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {3129#(and (<= main_~k~0 5) (<= 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 * ~y~0 * ~y~0 + ~x~0; {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:55:06,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:55:06,225 INFO L272 TraceCheckUtils]: 25: Hoare triple {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,226 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3073#true} {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #57#return; {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:55:06,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {3151#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:55:06,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:55:06,227 INFO L272 TraceCheckUtils]: 32: Hoare triple {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,228 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3073#true} {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #57#return; {3173#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:55:06,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {3173#(and (<= main_~k~0 5) (<= 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 * ~y~0 * ~y~0 + ~x~0; {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:55:06,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:55:06,229 INFO L272 TraceCheckUtils]: 39: Hoare triple {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,229 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3073#true} {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #57#return; {3195#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:55:06,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {3195#(and (<= main_~k~0 5) (<= 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 * ~y~0 * ~y~0 + ~x~0; {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:55:06,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:55:06,230 INFO L272 TraceCheckUtils]: 46: Hoare triple {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,231 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3073#true} {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #57#return; {3217#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:55:06,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {3217#(and (<= main_~k~0 5) (<= 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 * ~y~0 * ~y~0 + ~x~0; {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:55:06,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:55:06,232 INFO L272 TraceCheckUtils]: 53: Hoare triple {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,233 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3073#true} {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #57#return; {3239#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:55:06,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {3239#(and (<= main_~k~0 5) (<= 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 * ~y~0 * ~y~0 + ~x~0; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {3074#false} assume !false; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L272 TraceCheckUtils]: 60: Hoare triple {3074#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {3074#false} ~cond := #in~cond; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {3074#false} assume !(0 == ~cond); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {3074#false} assume true; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3074#false} {3074#false} #57#return; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {3074#false} assume !(~c~0 < ~k~0); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L272 TraceCheckUtils]: 66: Hoare triple {3074#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {3074#false} ~cond := #in~cond; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {3074#false} assume !(0 == ~cond); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {3074#false} assume true; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3074#false} {3074#false} #59#return; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L272 TraceCheckUtils]: 71: Hoare triple {3074#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {3074#false} ~cond := #in~cond; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {3074#false} assume 0 == ~cond; {3074#false} is VALID [2022-04-27 14:55:06,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {3074#false} assume !false; {3074#false} is VALID [2022-04-27 14:55:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 14:55:06,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:06,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {3074#false} assume !false; {3074#false} is VALID [2022-04-27 14:55:06,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {3074#false} assume 0 == ~cond; {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {3074#false} ~cond := #in~cond; {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L272 TraceCheckUtils]: 71: Hoare triple {3074#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3073#true} {3074#false} #59#return; {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L272 TraceCheckUtils]: 66: Hoare triple {3074#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {3074#false} assume !(~c~0 < ~k~0); {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3073#true} {3074#false} #57#return; {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L272 TraceCheckUtils]: 60: Hoare triple {3074#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {3074#false} assume !false; {3074#false} is VALID [2022-04-27 14:55:06,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {3357#(not (< main_~c~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 * ~y~0 * ~y~0 + ~x~0; {3074#false} is VALID [2022-04-27 14:55:06,585 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3073#true} {3357#(not (< main_~c~0 main_~k~0))} #57#return; {3357#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:55:06,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,585 INFO L272 TraceCheckUtils]: 53: Hoare triple {3357#(not (< main_~c~0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {3357#(not (< main_~c~0 main_~k~0))} assume !false; {3357#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:55:06,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {3379#(<= main_~k~0 (+ main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3357#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:55:06,586 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3073#true} {3379#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {3379#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:55:06,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,587 INFO L272 TraceCheckUtils]: 46: Hoare triple {3379#(<= main_~k~0 (+ main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {3379#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {3379#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:55:06,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {3401#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3379#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:55:06,588 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3073#true} {3401#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {3401#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:55:06,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,588 INFO L272 TraceCheckUtils]: 39: Hoare triple {3401#(<= main_~k~0 (+ main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {3401#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {3401#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:55:06,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {3423#(<= main_~k~0 (+ main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3401#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:55:06,589 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3073#true} {3423#(<= main_~k~0 (+ main_~c~0 3))} #57#return; {3423#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:55:06,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,589 INFO L272 TraceCheckUtils]: 32: Hoare triple {3423#(<= main_~k~0 (+ main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {3423#(<= main_~k~0 (+ main_~c~0 3))} assume !false; {3423#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:55:06,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {3445#(<= main_~k~0 (+ main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3423#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:55:06,593 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3073#true} {3445#(<= main_~k~0 (+ main_~c~0 4))} #57#return; {3445#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:55:06,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,593 INFO L272 TraceCheckUtils]: 25: Hoare triple {3445#(<= main_~k~0 (+ main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {3445#(<= main_~k~0 (+ main_~c~0 4))} assume !false; {3445#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:55:06,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {3467#(<= 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 * ~y~0 * ~y~0 + ~x~0; {3445#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:55:06,594 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3073#true} {3467#(<= main_~k~0 (+ 5 main_~c~0))} #57#return; {3467#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:55:06,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,594 INFO L272 TraceCheckUtils]: 18: Hoare triple {3467#(<= main_~k~0 (+ 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {3467#(<= main_~k~0 (+ 5 main_~c~0))} assume !false; {3467#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:55:06,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3489#(<= main_~k~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3467#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:55:06,595 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3073#true} {3489#(<= main_~k~0 5)} #55#return; {3489#(<= main_~k~0 5)} is VALID [2022-04-27 14:55:06,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {3073#true} assume !(0 == ~cond); {3073#true} is VALID [2022-04-27 14:55:06,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {3073#true} ~cond := #in~cond; {3073#true} is VALID [2022-04-27 14:55:06,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {3489#(<= main_~k~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3103#(not (= |assume_abort_if_not_#in~cond| 0))} {3073#true} #53#return; {3489#(<= main_~k~0 5)} is VALID [2022-04-27 14:55:06,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3103#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:55:06,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {3517#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3103#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:55:06,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {3073#true} ~cond := #in~cond; {3517#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:55:06,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {3073#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3073#true} is VALID [2022-04-27 14:55:06,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {3073#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; {3073#true} is VALID [2022-04-27 14:55:06,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {3073#true} call #t~ret5 := main(); {3073#true} is VALID [2022-04-27 14:55:06,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3073#true} {3073#true} #63#return; {3073#true} is VALID [2022-04-27 14:55:06,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {3073#true} assume true; {3073#true} is VALID [2022-04-27 14:55:06,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3073#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); {3073#true} is VALID [2022-04-27 14:55:06,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {3073#true} call ULTIMATE.init(); {3073#true} is VALID [2022-04-27 14:55:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-27 14:55:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15714807] [2022-04-27 14:55:06,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656374020] [2022-04-27 14:55:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656374020] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:06,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:06,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-27 14:55:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521668900] [2022-04-27 14:55:06,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Word has length 75 [2022-04-27 14:55:06,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:06,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:55:06,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:55:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:55:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:55:06,656 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:55:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:07,015 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:55:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:55:07,015 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Word has length 75 [2022-04-27 14:55:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:55:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:55:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:55:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:55:07,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:55:07,051 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:55:07,051 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:55:07,051 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:55:07,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:55:07,052 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:07,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:55:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:55:07,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:07,053 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:55:07,053 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:55:07,053 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:55:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:07,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:07,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:07,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:07,053 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:55:07,053 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:55:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:07,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:07,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:07,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:07,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:07,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:07,054 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:55:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:55:07,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-27 14:55:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:07,054 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:55:07,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:55:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:07,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:07,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:55:07,061 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:55:07,261 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:55:07,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:55:07,809 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:55:07,809 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:55:07,809 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-27 14:55:07,810 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)) (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)))) [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)) (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)))) [2022-04-27 14:55:07,810 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse0 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)) (and (<= main_~k~0 1) (= main_~y~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) .cse0 (< 2 main_~k~0)))) [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 42) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:55:07,810 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 42) no Hoare annotation was computed. [2022-04-27 14:55:07,810 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)) (and (<= main_~k~0 1) (= main_~y~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) .cse0 (< 2 main_~k~0)))) [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:07,811 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:55:07,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:55:07,811 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:55:07,811 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:55:07,813 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-27 14:55:07,814 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:55:07,816 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:55:07,816 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:55:07,822 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:07,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:55:07,830 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:55:07,830 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:55:07,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:55:07 BoogieIcfgContainer [2022-04-27 14:55:07,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:55:07,841 INFO L158 Benchmark]: Toolchain (without parser) took 59419.11ms. Allocated memory was 192.9MB in the beginning and 247.5MB in the end (delta: 54.5MB). Free memory was 141.3MB in the beginning and 196.6MB in the end (delta: -55.3MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2022-04-27 14:55:07,841 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:55:07,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 192.9MB. Free memory was 141.1MB in the beginning and 165.8MB in the end (delta: -24.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 14:55:07,841 INFO L158 Benchmark]: Boogie Preprocessor took 36.27ms. Allocated memory is still 192.9MB. Free memory was 165.8MB in the beginning and 164.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:55:07,842 INFO L158 Benchmark]: RCFGBuilder took 250.56ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 153.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:55:07,842 INFO L158 Benchmark]: TraceAbstraction took 58919.29ms. Allocated memory was 192.9MB in the beginning and 247.5MB in the end (delta: 54.5MB). Free memory was 152.6MB in the beginning and 196.6MB in the end (delta: -44.0MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2022-04-27 14:55:07,843 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.09ms. Allocated memory is still 192.9MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 192.9MB. Free memory was 141.1MB in the beginning and 165.8MB in the end (delta: -24.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.27ms. Allocated memory is still 192.9MB. Free memory was 165.8MB in the beginning and 164.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.56ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 153.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 58919.29ms. Allocated memory was 192.9MB in the beginning and 247.5MB in the end (delta: 54.5MB). Free memory was 152.6MB in the beginning and 196.6MB in the end (delta: -44.0MB). Peak memory consumption was 128.3MB. 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 1416 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1139 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 277 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 510 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 37 PreInvPairs, 62 NumberOfFragments, 1056 HoareAnnotationTreeSize, 37 FomulaSimplifications, 162 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 170 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 43.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 1804 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1049 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 695/809 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: 28]: Loop Invariant Derived loop invariant: ((((((((k <= 5 && 0 <= k) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && c == 0) && y == 0) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y)) || ((((k <= 5 && y == 1) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) && c == 1)) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y)) || ((((k <= 5 && y == 3) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 2 < k) && c == 3)) || (((((c <= 5 && k <= 5) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 5 == y) && 5 <= c) && 4 < k) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:55:07,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...