./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_8-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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:45:15,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:45:15,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:45:15,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:45:15,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:45:15,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:45:15,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:45:15,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:45:15,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:45:15,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:45:15,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:45:15,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:45:15,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:45:15,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:45:15,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:45:15,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:45:15,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:45:15,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:45:15,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:45:15,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:45:15,909 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:45:15,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:45:15,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:45:15,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:45:15,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:45:15,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:45:15,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:45:15,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:45:15,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:45:15,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:45:15,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:45:15,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:45:15,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:45:15,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:45:15,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:45:15,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:45:15,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:45:15,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:45:15,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:45:15,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:45:15,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:45:15,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:45:15,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:45:15,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:45:15,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:45:15,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:45:15,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:45:15,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:45:15,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:45:15,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:45:15,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:45:15,954 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:45:15,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:45:15,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:45:15,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:45:15,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:45:15,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:45:15,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:45:15,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:45:15,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:45:15,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:45:15,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:45:15,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:45:15,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:45:15,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:45:15,958 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2022-07-22 17:45:16,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:45:16,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:45:16,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:45:16,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:45:16,184 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:45:16,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-07-22 17:45:16,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b51c96b/f0b51ca3a1994719b150d109190cd40f/FLAGa76e71ddc [2022-07-22 17:45:16,583 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:45:16,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-07-22 17:45:16,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b51c96b/f0b51ca3a1994719b150d109190cd40f/FLAGa76e71ddc [2022-07-22 17:45:16,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b51c96b/f0b51ca3a1994719b150d109190cd40f [2022-07-22 17:45:16,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:45:16,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:45:16,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:45:16,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:45:16,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:45:16,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516f4cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16, skipping insertion in model container [2022-07-22 17:45:16,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:45:16,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:45:16,738 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_8-2.c[947,960] [2022-07-22 17:45:16,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:45:16,746 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:45:16,759 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_8-2.c[947,960] [2022-07-22 17:45:16,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:45:16,770 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:45:16,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16 WrapperNode [2022-07-22 17:45:16,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:45:16,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:45:16,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:45:16,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:45:16,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,792 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-22 17:45:16,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:45:16,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:45:16,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:45:16,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:45:16,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:45:16,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:45:16,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:45:16,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:45:16,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (1/1) ... [2022-07-22 17:45:16,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:45:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:16,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 17:45:16,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 17:45:16,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-07-22 17:45:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-07-22 17:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-07-22 17:45:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-07-22 17:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:45:16,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:45:16,915 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:45:16,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:45:17,036 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:45:17,052 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:45:17,053 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 17:45:17,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:17 BoogieIcfgContainer [2022-07-22 17:45:17,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:45:17,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:45:17,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:45:17,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:45:17,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:45:16" (1/3) ... [2022-07-22 17:45:17,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6835d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:45:17, skipping insertion in model container [2022-07-22 17:45:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:16" (2/3) ... [2022-07-22 17:45:17,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6835d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:45:17, skipping insertion in model container [2022-07-22 17:45:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:17" (3/3) ... [2022-07-22 17:45:17,060 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-07-22 17:45:17,069 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:45:17,070 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:45:17,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:45:17,102 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c777184, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cecb7c0 [2022-07-22 17:45:17,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:45:17,118 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) [2022-07-22 17:45:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 17:45:17,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:17,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:17,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-07-22 17:45:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579990200] [2022-07-22 17:45:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:45:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:17,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579990200] [2022-07-22 17:45:17,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579990200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:45:17,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:45:17,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:45:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675810533] [2022-07-22 17:45:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:45:17,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:45:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:45:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:45:17,363 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) [2022-07-22 17:45:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:17,411 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-22 17:45:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:45:17,413 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 [2022-07-22 17:45:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:17,418 INFO L225 Difference]: With dead ends: 43 [2022-07-22 17:45:17,420 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 17:45:17,423 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:17,426 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:17,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:45:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 17:45:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 17:45:17,460 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) [2022-07-22 17:45:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-22 17:45:17,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-07-22 17:45:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:17,462 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-22 17:45:17,462 INFO L496 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) [2022-07-22 17:45:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-22 17:45:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 17:45:17,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:17,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:45:17,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-07-22 17:45:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:17,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194921325] [2022-07-22 17:45:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:45:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:17,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194921325] [2022-07-22 17:45:17,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194921325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:45:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:45:17,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:45:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795640640] [2022-07-22 17:45:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:45:17,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:45:17,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:17,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:45:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:45:17,516 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) [2022-07-22 17:45:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:17,532 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-22 17:45:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:45:17,533 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 [2022-07-22 17:45:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:17,533 INFO L225 Difference]: With dead ends: 33 [2022-07-22 17:45:17,534 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 17:45:17,534 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:17,535 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:17,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:45:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 17:45:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-22 17:45:17,539 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) [2022-07-22 17:45:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-22 17:45:17,540 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-07-22 17:45:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:17,541 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-22 17:45:17,541 INFO L496 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) [2022-07-22 17:45:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-22 17:45:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 17:45:17,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:17,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:17,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 17:45:17,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-07-22 17:45:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:17,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803337405] [2022-07-22 17:45:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 17:45:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:17,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:17,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803337405] [2022-07-22 17:45:17,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803337405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:17,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379766385] [2022-07-22 17:45:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:17,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:17,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 17:45:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:17,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:45:17,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:17,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:18,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379766385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:18,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:18,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-22 17:45:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133664023] [2022-07-22 17:45:18,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:18,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:45:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:45:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:45:18,019 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) [2022-07-22 17:45:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:18,171 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-07-22 17:45:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:45:18,172 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 [2022-07-22 17:45:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:18,173 INFO L225 Difference]: With dead ends: 55 [2022-07-22 17:45:18,173 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 17:45:18,173 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:18,174 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:18,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:45:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 17:45:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-22 17:45:18,178 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) [2022-07-22 17:45:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-22 17:45:18,179 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-07-22 17:45:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:18,179 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-22 17:45:18,179 INFO L496 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) [2022-07-22 17:45:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-22 17:45:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 17:45:18,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:18,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:18,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:18,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:18,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-07-22 17:45:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:18,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137859286] [2022-07-22 17:45:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:18,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:18,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137859286] [2022-07-22 17:45:18,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137859286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672559587] [2022-07-22 17:45:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:18,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:18,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 17:45:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:18,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:45:18,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:18,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:45:18,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672559587] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:18,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:18,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-22 17:45:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817637691] [2022-07-22 17:45:18,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:18,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:45:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:45:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:45:18,709 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) [2022-07-22 17:45:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:18,836 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-07-22 17:45:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:45:18,836 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 [2022-07-22 17:45:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:18,840 INFO L225 Difference]: With dead ends: 51 [2022-07-22 17:45:18,840 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 17:45:18,840 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:18,841 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:18,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 92 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:45:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 17:45:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-22 17:45:18,860 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) [2022-07-22 17:45:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-22 17:45:18,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-07-22 17:45:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-22 17:45:18,861 INFO L496 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) [2022-07-22 17:45:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-07-22 17:45:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 17:45:18,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:18,862 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:45:18,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:19,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 17:45:19,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-07-22 17:45:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496476427] [2022-07-22 17:45:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 17:45:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:45:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:45:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:19,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496476427] [2022-07-22 17:45:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496476427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520748252] [2022-07-22 17:45:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:19,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 17:45:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 17:45:19,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:45:19,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:45:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520748252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:19,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:19,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-07-22 17:45:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708140136] [2022-07-22 17:45:19,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 17:45:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 17:45:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-22 17:45:19,563 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) [2022-07-22 17:45:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:19,748 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-07-22 17:45:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 17:45:19,748 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 [2022-07-22 17:45:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:19,752 INFO L225 Difference]: With dead ends: 105 [2022-07-22 17:45:19,752 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 17:45:19,755 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:19,757 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:19,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 95 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:45:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 17:45:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-22 17:45:19,770 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) [2022-07-22 17:45:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-07-22 17:45:19,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-07-22 17:45:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:19,773 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-07-22 17:45:19,773 INFO L496 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) [2022-07-22 17:45:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-07-22 17:45:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 17:45:19,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:19,776 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:45:19,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:19,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-07-22 17:45:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020273231] [2022-07-22 17:45:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 17:45:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020273231] [2022-07-22 17:45:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020273231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862287786] [2022-07-22 17:45:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:20,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:20,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 17:45:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 17:45:20,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:45:20,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:45:20,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862287786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:20,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:20,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-07-22 17:45:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431843502] [2022-07-22 17:45:20,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:20,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 17:45:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 17:45:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-22 17:45:20,387 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) [2022-07-22 17:45:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:20,688 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-07-22 17:45:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 17:45:20,689 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 [2022-07-22 17:45:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:20,690 INFO L225 Difference]: With dead ends: 177 [2022-07-22 17:45:20,690 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 17:45:20,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-22 17:45:20,692 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:20,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:45:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 17:45:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-22 17:45:20,710 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) [2022-07-22 17:45:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-07-22 17:45:20,716 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-07-22 17:45:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:20,719 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-07-22 17:45:20,719 INFO L496 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) [2022-07-22 17:45:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-07-22 17:45:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 17:45:20,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:20,723 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:45:20,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:20,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:20,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-07-22 17:45:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756834082] [2022-07-22 17:45:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:45:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 17:45:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:21,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756834082] [2022-07-22 17:45:21,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756834082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:21,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044133573] [2022-07-22 17:45:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:21,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:21,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:21,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:21,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 17:45:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:21,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 17:45:21,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:45:21,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 17:45:21,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044133573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:21,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:21,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-07-22 17:45:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300247407] [2022-07-22 17:45:21,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 17:45:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:21,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 17:45:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-22 17:45:21,528 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) [2022-07-22 17:45:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:21,876 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-07-22 17:45:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 17:45:21,877 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 [2022-07-22 17:45:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:21,879 INFO L225 Difference]: With dead ends: 255 [2022-07-22 17:45:21,879 INFO L226 Difference]: Without dead ends: 155 [2022-07-22 17:45:21,880 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:45:21,880 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:21,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 227 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:45:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-22 17:45:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-07-22 17:45:21,893 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) [2022-07-22 17:45:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-07-22 17:45:21,894 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-07-22 17:45:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:21,895 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-07-22 17:45:21,895 INFO L496 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) [2022-07-22 17:45:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-07-22 17:45:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 17:45:21,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:21,897 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:45:21,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:22,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:22,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-07-22 17:45:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:22,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434233806] [2022-07-22 17:45:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 17:45:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 17:45:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:22,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434233806] [2022-07-22 17:45:22,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434233806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:22,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037990259] [2022-07-22 17:45:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:22,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:22,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 17:45:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:22,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 17:45:22,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-22 17:45:22,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-22 17:45:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037990259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:22,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:22,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-07-22 17:45:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767697913] [2022-07-22 17:45:22,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 17:45:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 17:45:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-07-22 17:45:22,947 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-22 17:45:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:23,313 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-07-22 17:45:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 17:45:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2022-07-22 17:45:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:23,315 INFO L225 Difference]: With dead ends: 240 [2022-07-22 17:45:23,315 INFO L226 Difference]: Without dead ends: 107 [2022-07-22 17:45:23,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-07-22 17:45:23,317 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:23,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 209 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:45:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-22 17:45:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-07-22 17:45:23,332 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) [2022-07-22 17:45:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-07-22 17:45:23,332 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-07-22 17:45:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:23,333 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-07-22 17:45:23,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-22 17:45:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-07-22 17:45:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-22 17:45:23,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:23,334 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:45:23,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:23,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:23,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-07-22 17:45:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:23,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161669146] [2022-07-22 17:45:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 17:45:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 17:45:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-07-22 17:45:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:23,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161669146] [2022-07-22 17:45:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161669146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865196855] [2022-07-22 17:45:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:23,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:23,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 17:45:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:23,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 17:45:23,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-07-22 17:45:23,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-22 17:45:24,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865196855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:24,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:24,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-07-22 17:45:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902696139] [2022-07-22 17:45:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:24,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 17:45:24,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 17:45:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-07-22 17:45:24,780 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-22 17:45:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:25,227 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-07-22 17:45:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 17:45:25,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2022-07-22 17:45:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:25,232 INFO L225 Difference]: With dead ends: 214 [2022-07-22 17:45:25,232 INFO L226 Difference]: Without dead ends: 134 [2022-07-22 17:45:25,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 17:45:25,235 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:25,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 235 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:45:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-22 17:45:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-07-22 17:45:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2022-07-22 17:45:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-07-22 17:45:25,257 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-07-22 17:45:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:25,257 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-07-22 17:45:25,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-22 17:45:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-07-22 17:45:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-22 17:45:25,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:25,261 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:25,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:25,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-07-22 17:45:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525282323] [2022-07-22 17:45:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 17:45:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 17:45:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 17:45:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2022-07-22 17:45:25,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:25,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525282323] [2022-07-22 17:45:25,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525282323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:25,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564963826] [2022-07-22 17:45:25,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:45:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:25,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:25,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:25,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 17:45:25,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:45:25,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:45:25,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 17:45:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-07-22 17:45:26,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-07-22 17:45:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564963826] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:27,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:27,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2022-07-22 17:45:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879629797] [2022-07-22 17:45:27,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:27,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 17:45:27,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 17:45:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-07-22 17:45:27,346 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-07-22 17:45:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:27,857 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-07-22 17:45:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-22 17:45:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 271 [2022-07-22 17:45:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:27,860 INFO L225 Difference]: With dead ends: 260 [2022-07-22 17:45:27,860 INFO L226 Difference]: Without dead ends: 155 [2022-07-22 17:45:27,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-07-22 17:45:27,862 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:27,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:45:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-22 17:45:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-07-22 17:45:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2022-07-22 17:45:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-07-22 17:45:27,874 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-07-22 17:45:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:27,875 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-07-22 17:45:27,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-07-22 17:45:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-07-22 17:45:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-07-22 17:45:27,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:27,879 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:27,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:28,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 17:45:28,093 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2022-07-22 17:45:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503779261] [2022-07-22 17:45:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 17:45:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 17:45:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-22 17:45:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 17:45:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2022-07-22 17:45:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:28,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503779261] [2022-07-22 17:45:28,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503779261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:28,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201861651] [2022-07-22 17:45:28,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:45:28,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:28,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:28,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 17:45:28,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 17:45:28,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:45:28,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:45:28,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-07-22 17:45:28,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-07-22 17:45:29,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201861651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:29,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:29,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-07-22 17:45:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617106121] [2022-07-22 17:45:29,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 17:45:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 17:45:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-07-22 17:45:29,379 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-22 17:45:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:29,548 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2022-07-22 17:45:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 17:45:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 394 [2022-07-22 17:45:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:29,550 INFO L225 Difference]: With dead ends: 283 [2022-07-22 17:45:29,550 INFO L226 Difference]: Without dead ends: 147 [2022-07-22 17:45:29,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-07-22 17:45:29,551 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:29,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 161 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:45:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-22 17:45:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-22 17:45:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.198019801980198) internal successors, (121), 98 states have internal predecessors, (121), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (66), 26 states have call predecessors, (66), 26 states have call successors, (66) [2022-07-22 17:45:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2022-07-22 17:45:29,564 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2022-07-22 17:45:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:29,565 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2022-07-22 17:45:29,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-22 17:45:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2022-07-22 17:45:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-07-22 17:45:29,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:29,570 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:29,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:29,787 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2022-07-22 17:45:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039932097] [2022-07-22 17:45:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 17:45:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-22 17:45:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 17:45:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-22 17:45:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2022-07-22 17:45:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:30,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039932097] [2022-07-22 17:45:30,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039932097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:30,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977030377] [2022-07-22 17:45:30,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:45:30,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:30,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:30,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:30,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 17:45:30,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:45:30,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:45:30,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 17:45:30,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2022-07-22 17:45:30,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2022-07-22 17:45:33,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977030377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:33,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:33,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2022-07-22 17:45:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102917055] [2022-07-22 17:45:33,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:33,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 17:45:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 17:45:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 17:45:33,114 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-22 17:45:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:34,054 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2022-07-22 17:45:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-22 17:45:34,054 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) Word has length 542 [2022-07-22 17:45:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:34,056 INFO L225 Difference]: With dead ends: 355 [2022-07-22 17:45:34,056 INFO L226 Difference]: Without dead ends: 183 [2022-07-22 17:45:34,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2022-07-22 17:45:34,059 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 172 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:34,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 499 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 17:45:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-22 17:45:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2022-07-22 17:45:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.091743119266055) internal successors, (119), 106 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 16 states have return successors, (42), 26 states have call predecessors, (42), 29 states have call successors, (42) [2022-07-22 17:45:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-07-22 17:45:34,067 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2022-07-22 17:45:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:34,068 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-07-22 17:45:34,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-22 17:45:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-07-22 17:45:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-07-22 17:45:34,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:34,073 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:34,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:34,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 17:45:34,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2022-07-22 17:45:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:34,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595966592] [2022-07-22 17:45:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 17:45:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-22 17:45:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-22 17:45:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:45:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 17:45:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 17:45:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:45:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:45:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:45:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2022-07-22 17:45:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595966592] [2022-07-22 17:45:34,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595966592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:34,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557225137] [2022-07-22 17:45:34,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:45:34,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:34,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:45:34,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 17:45:35,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-22 17:45:35,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:45:35,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 17:45:35,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2022-07-22 17:45:35,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2022-07-22 17:45:36,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557225137] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:36,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:36,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2022-07-22 17:45:36,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714757224] [2022-07-22 17:45:36,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:36,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 17:45:36,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:36,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 17:45:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2022-07-22 17:45:36,428 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-07-22 17:45:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:37,059 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2022-07-22 17:45:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-22 17:45:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) Word has length 433 [2022-07-22 17:45:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:37,061 INFO L225 Difference]: With dead ends: 333 [2022-07-22 17:45:37,062 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 17:45:37,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-07-22 17:45:37,063 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:45:37,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 584 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:45:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 17:45:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-07-22 17:45:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 110 states have internal predecessors, (118), 30 states have call successors, (30), 23 states have call predecessors, (30), 16 states have return successors, (41), 25 states have call predecessors, (41), 30 states have call successors, (41) [2022-07-22 17:45:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2022-07-22 17:45:37,070 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2022-07-22 17:45:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:37,070 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2022-07-22 17:45:37,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-07-22 17:45:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2022-07-22 17:45:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-07-22 17:45:37,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:37,073 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:37,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 17:45:37,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 17:45:37,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:37,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2022-07-22 17:45:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:37,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314679527] [2022-07-22 17:45:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:45:37,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 17:45:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:45:37,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 17:45:37,406 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 17:45:37,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 17:45:37,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 17:45:37,411 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:37,414 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 17:45:37,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:45:37 BoogieIcfgContainer [2022-07-22 17:45:37,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 17:45:37,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 17:45:37,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 17:45:37,513 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 17:45:37,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:17" (3/4) ... [2022-07-22 17:45:37,514 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 17:45:37,590 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 17:45:37,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 17:45:37,591 INFO L158 Benchmark]: Toolchain (without parser) took 20987.06ms. Allocated memory was 104.9MB in the beginning and 285.2MB in the end (delta: 180.4MB). Free memory was 75.5MB in the beginning and 120.1MB in the end (delta: -44.6MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,591 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:45:37,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.52ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 81.1MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.84ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,592 INFO L158 Benchmark]: Boogie Preprocessor took 27.79ms. Allocated memory is still 104.9MB. Free memory was 79.7MB in the beginning and 79.0MB in the end (delta: 716.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:45:37,592 INFO L158 Benchmark]: RCFGBuilder took 232.85ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 69.5MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,592 INFO L158 Benchmark]: TraceAbstraction took 20456.42ms. Allocated memory was 104.9MB in the beginning and 285.2MB in the end (delta: 180.4MB). Free memory was 68.8MB in the beginning and 130.6MB in the end (delta: -61.8MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,592 INFO L158 Benchmark]: Witness Printer took 77.97ms. Allocated memory is still 285.2MB. Free memory was 130.6MB in the beginning and 120.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 17:45:37,595 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.17ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.52ms. Allocated memory is still 104.9MB. Free memory was 75.5MB in the beginning and 81.1MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.84ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.79ms. Allocated memory is still 104.9MB. Free memory was 79.7MB in the beginning and 79.0MB in the end (delta: 716.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.85ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 69.5MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20456.42ms. Allocated memory was 104.9MB in the beginning and 285.2MB in the end (delta: 180.4MB). Free memory was 68.8MB in the beginning and 130.6MB in the end (delta: -61.8MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. * Witness Printer took 77.97ms. Allocated memory is still 285.2MB. Free memory was 130.6MB in the beginning and 120.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) 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); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1042 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 2951 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2545 mSDsCounter, 1202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6352 IncrementalHoareTripleChecker+Invalid, 7554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1202 mSolverCounterUnsat, 406 mSDtfsCounter, 6352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, InterpolantAutomatonStates: 260, 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, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6142 ConstructedInterpolants, 0 QuantifiedInterpolants, 9059 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 56580/63747 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! [2022-07-22 17:45:37,631 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