./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:49:27,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:49:27,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:49:27,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:49:27,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:49:27,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:49:27,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:49:27,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:49:27,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:49:27,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:49:27,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:49:27,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:49:27,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:49:27,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:49:27,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:49:27,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:49:27,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:49:27,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:49:27,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:49:27,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:49:27,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:49:27,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:49:27,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:49:27,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:49:27,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:49:27,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:49:27,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:49:27,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:49:27,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:49:27,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:49:27,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:49:27,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:49:27,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:49:27,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:49:27,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:49:27,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:49:27,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:49:27,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:49:27,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:49:27,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:49:27,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:49:27,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:49:27,806 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:49:27,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:49:27,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:49:27,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:49:27,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:49:27,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:49:27,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:49:27,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:49:27,809 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:49:27,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:49:27,810 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:49:27,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:49:27,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:49:27,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:49:27,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:49:27,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:49:27,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:49:27,811 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:49:27,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:49:27,812 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:49:27,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:49:27,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:49:27,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:49:27,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:49:27,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:27,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:49:27,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:49:27,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:49:27,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:49:27,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:49:27,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:49:27,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:49:27,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:49:27,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:49:27,815 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2021-12-14 14:49:28,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:49:28,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:49:28,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:49:28,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:49:28,083 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:49:28,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-14 14:49:28,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e72dc4bc/8755d37d20f54da28a85eec28a1deb6b/FLAG5b07dad97 [2021-12-14 14:49:28,459 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:49:28,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-14 14:49:28,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e72dc4bc/8755d37d20f54da28a85eec28a1deb6b/FLAG5b07dad97 [2021-12-14 14:49:28,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e72dc4bc/8755d37d20f54da28a85eec28a1deb6b [2021-12-14 14:49:28,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:49:28,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:49:28,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:28,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:49:28,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:49:28,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1afb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28, skipping insertion in model container [2021-12-14 14:49:28,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:49:28,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:49:28,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-14 14:49:28,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:28,643 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:49:28,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-14 14:49:28,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:28,671 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:49:28,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28 WrapperNode [2021-12-14 14:49:28,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:28,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:28,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:49:28,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:49:28,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,695 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-14 14:49:28,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:28,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:49:28,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:49:28,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:49:28,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:49:28,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:49:28,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:49:28,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:49:28,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (1/1) ... [2021-12-14 14:49:28,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:28,747 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) [2021-12-14 14:49:28,754 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 [2021-12-14 14:49:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:49:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:49:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-14 14:49:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-14 14:49:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-14 14:49:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-14 14:49:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:49:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:49:28,824 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:49:28,825 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:49:28,947 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:49:28,951 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:49:28,952 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 14:49:28,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:28 BoogieIcfgContainer [2021-12-14 14:49:28,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:49:28,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:49:28,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:49:28,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:49:28,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:49:28" (1/3) ... [2021-12-14 14:49:28,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a693cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:28, skipping insertion in model container [2021-12-14 14:49:28,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:28" (2/3) ... [2021-12-14 14:49:28,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a693cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:28, skipping insertion in model container [2021-12-14 14:49:28,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:28" (3/3) ... [2021-12-14 14:49:28,959 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2021-12-14 14:49:28,963 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:49:28,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:49:29,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:49:29,023 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 14:49:29,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:49:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 14:49:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 14:49:29,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:29,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:29,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-14 14:49:29,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:29,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914702636] [2021-12-14 14:49:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:29,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:49:29,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:29,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914702636] [2021-12-14 14:49:29,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914702636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:49:29,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:49:29,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:49:29,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643723186] [2021-12-14 14:49:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:49:29,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:49:29,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:49:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:29,291 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:29,327 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-14 14:49:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:49:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-14 14:49:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:29,336 INFO L225 Difference]: With dead ends: 43 [2021-12-14 14:49:29,337 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 14:49:29,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:29,342 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:29,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:49:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 14:49:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 14:49:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:49:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:49:29,381 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-14 14:49:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:29,382 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:49:29,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:49:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 14:49:29,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:29,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:29,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:49:29,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-14 14:49:29,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:29,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732092114] [2021-12-14 14:49:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:29,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:49:29,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:29,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732092114] [2021-12-14 14:49:29,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732092114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:49:29,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:49:29,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:49:29,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931294362] [2021-12-14 14:49:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:49:29,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:49:29,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:49:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:29,463 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:29,483 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-14 14:49:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:49:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-14 14:49:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:29,486 INFO L225 Difference]: With dead ends: 33 [2021-12-14 14:49:29,486 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 14:49:29,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:49:29,491 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:29,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:49:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 14:49:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-14 14:49:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-14 14:49:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-14 14:49:29,501 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-14 14:49:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:29,502 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-14 14:49:29,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 14:49:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-14 14:49:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 14:49:29,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:29,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:29,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 14:49:29,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-14 14:49:29,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:29,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928151964] [2021-12-14 14:49:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:29,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:49:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:29,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928151964] [2021-12-14 14:49:29,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928151964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616081492] [2021-12-14 14:49:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:29,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:29,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:29,623 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) [2021-12-14 14:49:29,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 14:49:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:29,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:49:29,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:29,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:29,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616081492] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:29,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:29,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-14 14:49:29,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117766200] [2021-12-14 14:49:29,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:29,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:49:29,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:49:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:49:29,962 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 14:49:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:30,114 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-14 14:49:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:49:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-12-14 14:49:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:30,116 INFO L225 Difference]: With dead ends: 55 [2021-12-14 14:49:30,117 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 14:49:30,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:49:30,121 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:30,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 14:49:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-14 14:49:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 14:49:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-14 14:49:30,133 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-14 14:49:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:30,133 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-14 14:49:30,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 14:49:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-14 14:49:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 14:49:30,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:30,137 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:30,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:30,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:30,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-14 14:49:30,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:30,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727795219] [2021-12-14 14:49:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:30,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:30,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:30,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727795219] [2021-12-14 14:49:30,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727795219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364014777] [2021-12-14 14:49:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:30,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:30,472 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) [2021-12-14 14:49:30,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 14:49:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:30,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:49:30,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:30,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:49:30,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364014777] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:30,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:30,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-14 14:49:30,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476248806] [2021-12-14 14:49:30,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:30,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:49:30,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:49:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:49:30,744 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-14 14:49:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:30,836 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-14 14:49:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 14:49:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-12-14 14:49:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:30,839 INFO L225 Difference]: With dead ends: 51 [2021-12-14 14:49:30,839 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 14:49:30,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-14 14:49:30,840 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:30,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 14:49:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-14 14:49:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-14 14:49:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-14 14:49:30,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-14 14:49:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:30,874 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-14 14:49:30,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-14 14:49:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-14 14:49:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 14:49:30,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:30,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:30,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:31,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 14:49:31,098 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-14 14:49:31,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:31,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779596828] [2021-12-14 14:49:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:31,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 14:49:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 14:49:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:49:31,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:31,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779596828] [2021-12-14 14:49:31,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779596828] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:31,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939638938] [2021-12-14 14:49:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:31,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:31,193 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) [2021-12-14 14:49:31,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 14:49:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:31,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:49:31,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 14:49:31,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:49:31,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939638938] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:31,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:31,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-14 14:49:31,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910000612] [2021-12-14 14:49:31,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:31,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 14:49:31,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 14:49:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-14 14:49:31,684 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:31,854 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-14 14:49:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 14:49:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-14 14:49:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:31,856 INFO L225 Difference]: With dead ends: 105 [2021-12-14 14:49:31,856 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 14:49:31,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-14 14:49:31,857 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:31,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:49:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 14:49:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-14 14:49:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-14 14:49:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-14 14:49:31,864 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-14 14:49:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:31,865 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-14 14:49:31,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-14 14:49:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 14:49:31,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:31,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:31,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:32,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:32,084 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-14 14:49:32,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:32,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707795957] [2021-12-14 14:49:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:32,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 14:49:32,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707795957] [2021-12-14 14:49:32,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707795957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155947259] [2021-12-14 14:49:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:32,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:32,184 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) [2021-12-14 14:49:32,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 14:49:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:32,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:49:32,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 14:49:32,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 14:49:32,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155947259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:32,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:32,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-14 14:49:32,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473654590] [2021-12-14 14:49:32,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:32,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 14:49:32,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:32,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 14:49:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-14 14:49:32,556 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:32,819 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-14 14:49:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 14:49:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-14 14:49:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:32,821 INFO L225 Difference]: With dead ends: 177 [2021-12-14 14:49:32,821 INFO L226 Difference]: Without dead ends: 117 [2021-12-14 14:49:32,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:49:32,823 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:32,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-14 14:49:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-14 14:49:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-14 14:49:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-14 14:49:32,838 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-14 14:49:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:32,838 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-14 14:49:32,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-14 14:49:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-14 14:49:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 14:49:32,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:32,843 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:32,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:33,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:33,059 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-14 14:49:33,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:33,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442321907] [2021-12-14 14:49:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:33,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 14:49:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 14:49:33,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:33,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442321907] [2021-12-14 14:49:33,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442321907] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:33,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010155904] [2021-12-14 14:49:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:33,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:33,177 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) [2021-12-14 14:49:33,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 14:49:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:33,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:49:33,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 14:49:33,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 14:49:33,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010155904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:33,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:33,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-14 14:49:33,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725017735] [2021-12-14 14:49:33,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:33,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 14:49:33,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:33,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 14:49:33,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-14 14:49:33,768 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:49:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:34,112 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-14 14:49:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 14:49:34,113 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-14 14:49:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:34,114 INFO L225 Difference]: With dead ends: 255 [2021-12-14 14:49:34,114 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 14:49:34,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-14 14:49:34,116 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:34,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 14:49:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-14 14:49:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-14 14:49:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-14 14:49:34,129 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-14 14:49:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:34,130 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-14 14:49:34,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-14 14:49:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-14 14:49:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 14:49:34,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:34,132 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:34,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-14 14:49:34,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:34,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-14 14:49:34,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880478830] [2021-12-14 14:49:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:34,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:49:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-14 14:49:34,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880478830] [2021-12-14 14:49:34,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880478830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48051906] [2021-12-14 14:49:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:34,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:34,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:34,545 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) [2021-12-14 14:49:34,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 14:49:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:34,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:49:34,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-14 14:49:34,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-14 14:49:35,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48051906] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:35,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:35,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-12-14 14:49:35,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078635700] [2021-12-14 14:49:35,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:35,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 14:49:35,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:35,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 14:49:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-12-14 14:49:35,444 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-14 14:49:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:35,791 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-14 14:49:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 14:49:35,791 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) Word has length 93 [2021-12-14 14:49:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:35,793 INFO L225 Difference]: With dead ends: 240 [2021-12-14 14:49:35,793 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 14:49:35,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 14:49:35,795 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:35,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 237 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 14:49:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-14 14:49:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-14 14:49:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-14 14:49:35,812 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-14 14:49:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:35,813 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-14 14:49:35,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-14 14:49:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-14 14:49:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-14 14:49:35,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:35,815 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:35,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:36,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:36,027 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-14 14:49:36,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:36,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162977670] [2021-12-14 14:49:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:36,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 14:49:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 14:49:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-14 14:49:36,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162977670] [2021-12-14 14:49:36,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162977670] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978107672] [2021-12-14 14:49:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:36,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:36,276 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) [2021-12-14 14:49:36,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 14:49:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:36,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:49:36,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 121 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-12-14 14:49:36,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 126 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-12-14 14:49:37,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978107672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:37,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:37,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2021-12-14 14:49:37,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948020491] [2021-12-14 14:49:37,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:37,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 14:49:37,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 14:49:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-14 14:49:37,186 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-14 14:49:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:37,458 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-14 14:49:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 14:49:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-14 14:49:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:37,459 INFO L225 Difference]: With dead ends: 169 [2021-12-14 14:49:37,460 INFO L226 Difference]: Without dead ends: 93 [2021-12-14 14:49:37,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2021-12-14 14:49:37,461 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:37,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 270 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-14 14:49:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-12-14 14:49:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (35), 18 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-14 14:49:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2021-12-14 14:49:37,473 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 148 [2021-12-14 14:49:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:37,474 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2021-12-14 14:49:37,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-14 14:49:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2021-12-14 14:49:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-14 14:49:37,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:37,475 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:37,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:37,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:37,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2043735506, now seen corresponding path program 2 times [2021-12-14 14:49:37,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020396620] [2021-12-14 14:49:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:37,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 14:49:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 14:49:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 112 proven. 115 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-12-14 14:49:37,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:37,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020396620] [2021-12-14 14:49:37,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020396620] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:37,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189001989] [2021-12-14 14:49:37,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 14:49:37,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:37,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:37,901 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) [2021-12-14 14:49:37,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 14:49:37,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 14:49:37,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:37,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:49:37,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 101 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-12-14 14:49:38,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 106 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-14 14:49:38,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189001989] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:38,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:38,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 21 [2021-12-14 14:49:38,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844987022] [2021-12-14 14:49:38,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:38,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 14:49:38,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 14:49:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-12-14 14:49:38,790 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-14 14:49:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:39,043 INFO L93 Difference]: Finished difference Result 184 states and 267 transitions. [2021-12-14 14:49:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 14:49:39,043 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-14 14:49:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:39,044 INFO L225 Difference]: With dead ends: 184 [2021-12-14 14:49:39,045 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 14:49:39,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-12-14 14:49:39,046 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:39,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 268 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 14:49:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-12-14 14:49:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (33), 18 states have call predecessors, (33), 14 states have call successors, (33) [2021-12-14 14:49:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2021-12-14 14:49:39,051 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 148 [2021-12-14 14:49:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:39,051 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2021-12-14 14:49:39,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-14 14:49:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2021-12-14 14:49:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-14 14:49:39,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:39,053 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:39,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 14:49:39,267 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -552714558, now seen corresponding path program 3 times [2021-12-14 14:49:39,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:39,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674506008] [2021-12-14 14:49:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:39,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 14:49:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-14 14:49:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 207 proven. 121 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2021-12-14 14:49:39,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:39,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674506008] [2021-12-14 14:49:39,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674506008] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076543124] [2021-12-14 14:49:39,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 14:49:39,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:39,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 14:49:39,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 14:49:39,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:39,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:49:39,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 32 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2021-12-14 14:49:39,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 34 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2021-12-14 14:49:40,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076543124] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:40,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:40,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 24 [2021-12-14 14:49:40,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936443906] [2021-12-14 14:49:40,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:40,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 14:49:40,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 14:49:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-12-14 14:49:40,360 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-14 14:49:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:40,629 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-12-14 14:49:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-14 14:49:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) Word has length 174 [2021-12-14 14:49:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:40,631 INFO L225 Difference]: With dead ends: 187 [2021-12-14 14:49:40,631 INFO L226 Difference]: Without dead ends: 106 [2021-12-14 14:49:40,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 14:49:40,632 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:40,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 276 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:49:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-14 14:49:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2021-12-14 14:49:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2021-12-14 14:49:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2021-12-14 14:49:40,637 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 174 [2021-12-14 14:49:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:40,637 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2021-12-14 14:49:40,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-14 14:49:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2021-12-14 14:49:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-14 14:49:40,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:40,639 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:40,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:40,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:40,855 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash -712391191, now seen corresponding path program 4 times [2021-12-14 14:49:40,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:40,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82648253] [2021-12-14 14:49:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:40,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:40,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:49:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 14:49:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 14:49:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 14:49:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 14:49:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:49:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:49:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 14:49:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:49:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 194 proven. 345 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-12-14 14:49:41,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:49:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82648253] [2021-12-14 14:49:41,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82648253] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:49:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609625030] [2021-12-14 14:49:41,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 14:49:41,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:49:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:41,172 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:49:41,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 14:49:41,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 14:49:41,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:49:41,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 14:49:41,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:49:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 97 proven. 261 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2021-12-14 14:49:41,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:49:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 101 proven. 265 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2021-12-14 14:49:42,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609625030] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:49:42,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:49:42,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 13] total 33 [2021-12-14 14:49:42,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461285422] [2021-12-14 14:49:42,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:49:42,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 14:49:42,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:49:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 14:49:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 14:49:42,456 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-14 14:49:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:49:43,197 INFO L93 Difference]: Finished difference Result 250 states and 417 transitions. [2021-12-14 14:49:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-14 14:49:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) Word has length 217 [2021-12-14 14:49:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:49:43,199 INFO L225 Difference]: With dead ends: 250 [2021-12-14 14:49:43,199 INFO L226 Difference]: Without dead ends: 131 [2021-12-14 14:49:43,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2021-12-14 14:49:43,201 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 159 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 14:49:43,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 520 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 14:49:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-14 14:49:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2021-12-14 14:49:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 83 states have internal predecessors, (96), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-14 14:49:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2021-12-14 14:49:43,208 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 217 [2021-12-14 14:49:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:49:43,208 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2021-12-14 14:49:43,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-14 14:49:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2021-12-14 14:49:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-14 14:49:43,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:43,210 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:43,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 14:49:43,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 14:49:43,423 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 521886258, now seen corresponding path program 5 times [2021-12-14 14:49:43,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77949118] [2021-12-14 14:49:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:43,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:49:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:43,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 14:49:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:49:43,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 14:49:43,489 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 14:49:43,490 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:49:43,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 14:49:43,494 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:43,497 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:49:43,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:49:43 BoogieIcfgContainer [2021-12-14 14:49:43,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:49:43,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:49:43,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:49:43,563 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:49:43,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:28" (3/4) ... [2021-12-14 14:49:43,565 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 14:49:43,634 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:49:43,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:49:43,634 INFO L158 Benchmark]: Toolchain (without parser) took 15152.03ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 65.7MB in the beginning and 137.4MB in the end (delta: -71.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,634 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 22.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:43,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 76.2MB in the end (delta: -10.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.28ms. Allocated memory is still 98.6MB. Free memory was 76.2MB in the beginning and 74.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,636 INFO L158 Benchmark]: Boogie Preprocessor took 26.41ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:49:43,636 INFO L158 Benchmark]: RCFGBuilder took 229.66ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 64.7MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,636 INFO L158 Benchmark]: TraceAbstraction took 14608.22ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 64.4MB in the beginning and 142.7MB in the end (delta: -78.3MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,636 INFO L158 Benchmark]: Witness Printer took 70.75ms. Allocated memory is still 174.1MB. Free memory was 142.7MB in the beginning and 137.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 14:49:43,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 22.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 76.2MB in the end (delta: -10.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.28ms. Allocated memory is still 98.6MB. Free memory was 76.2MB in the beginning and 74.9MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.41ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 229.66ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 64.7MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14608.22ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 64.4MB in the beginning and 142.7MB in the end (delta: -78.3MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * Witness Printer took 70.75ms. Allocated memory is still 174.1MB. Free memory was 142.7MB in the beginning and 137.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] reach_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 2757 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2402 mSDsCounter, 942 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4171 IncrementalHoareTripleChecker+Invalid, 5113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 942 mSolverCounterUnsat, 355 mSDtfsCounter, 4171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2390 GetRequests, 2093 SyntacticMatches, 17 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=12, InterpolantAutomatonStates: 215, 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, 12 MinimizatonAttempts, 142 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2097 NumberOfCodeBlocks, 1942 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2842 ConstructedInterpolants, 0 QuantifiedInterpolants, 4962 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1959 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 8275/10407 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 RESULT: Ultimate proved your program to be incorrect! [2021-12-14 14:49:43,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE