./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 e19ca921 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-dev-e19ca92 [2021-12-22 11:40:49,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 11:40:49,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 11:40:49,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 11:40:49,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 11:40:49,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 11:40:49,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 11:40:49,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 11:40:49,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 11:40:49,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 11:40:49,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 11:40:49,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 11:40:49,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 11:40:49,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 11:40:49,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 11:40:49,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 11:40:49,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 11:40:49,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 11:40:49,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 11:40:49,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 11:40:49,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 11:40:49,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 11:40:49,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 11:40:49,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 11:40:49,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 11:40:49,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 11:40:49,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 11:40:49,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 11:40:49,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 11:40:49,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 11:40:49,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 11:40:49,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 11:40:49,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 11:40:49,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 11:40:49,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 11:40:49,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 11:40:49,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 11:40:49,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 11:40:49,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 11:40:49,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 11:40:49,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 11:40:49,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 11:40:49,944 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 11:40:49,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 11:40:49,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 11:40:49,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 11:40:49,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 11:40:49,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 11:40:49,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 11:40:49,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 11:40:49,947 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 11:40:49,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 11:40:49,948 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 11:40:49,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 11:40:49,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 11:40:49,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 11:40:49,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 11:40:49,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 11:40:49,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 11:40:49,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:40:49,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 11:40:49,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 11:40:49,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 11:40:49,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 11:40:49,952 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 [2021-12-22 11:40:50,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 11:40:50,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 11:40:50,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 11:40:50,193 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 11:40:50,194 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 11:40:50,195 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 [2021-12-22 11:40:50,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a309f51e0/8b44578ff4c74dc2bc9e8912abafe322/FLAG99291d6ad [2021-12-22 11:40:50,556 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 11:40:50,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-22 11:40:50,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a309f51e0/8b44578ff4c74dc2bc9e8912abafe322/FLAG99291d6ad [2021-12-22 11:40:50,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a309f51e0/8b44578ff4c74dc2bc9e8912abafe322 [2021-12-22 11:40:51,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 11:40:51,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 11:40:51,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 11:40:51,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 11:40:51,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 11:40:51,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cce16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51, skipping insertion in model container [2021-12-22 11:40:51,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 11:40:51,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 11:40:51,128 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] [2021-12-22 11:40:51,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:40:51,137 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 11:40:51,155 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] [2021-12-22 11:40:51,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:40:51,171 INFO L208 MainTranslator]: Completed translation [2021-12-22 11:40:51,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51 WrapperNode [2021-12-22 11:40:51,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 11:40:51,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 11:40:51,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 11:40:51,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 11:40:51,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,196 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-22 11:40:51,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 11:40:51,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 11:40:51,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 11:40:51,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 11:40:51,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 11:40:51,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 11:40:51,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 11:40:51,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 11:40:51,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (1/1) ... [2021-12-22 11:40:51,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:40:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:51,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 11:40:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 11:40:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 11:40:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 11:40:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-22 11:40:51,325 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-22 11:40:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-22 11:40:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-22 11:40:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 11:40:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 11:40:51,386 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 11:40:51,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 11:40:51,542 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 11:40:51,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 11:40:51,554 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 11:40:51,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:51 BoogieIcfgContainer [2021-12-22 11:40:51,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 11:40:51,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 11:40:51,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 11:40:51,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 11:40:51,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:40:51" (1/3) ... [2021-12-22 11:40:51,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd214b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:40:51, skipping insertion in model container [2021-12-22 11:40:51,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:51" (2/3) ... [2021-12-22 11:40:51,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd214b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:40:51, skipping insertion in model container [2021-12-22 11:40:51,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:51" (3/3) ... [2021-12-22 11:40:51,577 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-12-22 11:40:51,580 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 11:40:51,588 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 11:40:51,625 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 11:40:51,630 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 11:40:51,631 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 11:40:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-22 11:40:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 11:40:51,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:51,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:51,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-22 11:40:51,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:51,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100992354] [2021-12-22 11:40:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:51,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:40:51,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:51,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100992354] [2021-12-22 11:40:51,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100992354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:40:51,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:40:51,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:40:51,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807514379] [2021-12-22 11:40:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:40:51,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:40:51,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:40:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:51,980 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:40:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:52,022 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-22 11:40:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:40:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-22 11:40:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:52,034 INFO L225 Difference]: With dead ends: 43 [2021-12-22 11:40:52,034 INFO L226 Difference]: Without dead ends: 27 [2021-12-22 11:40:52,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:52,041 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:52,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:40:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-22 11:40:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-22 11:40:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-22 11:40:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-22 11:40:52,090 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-22 11:40:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:52,091 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-22 11:40:52,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:40:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-22 11:40:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 11:40:52,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:52,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:52,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 11:40:52,095 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-22 11:40:52,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:52,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704958219] [2021-12-22 11:40:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:52,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:40:52,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:52,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704958219] [2021-12-22 11:40:52,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704958219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:40:52,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:40:52,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:40:52,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354059333] [2021-12-22 11:40:52,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:40:52,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:40:52,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:52,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:40:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:52,183 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:40:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:52,203 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-22 11:40:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:40:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-22 11:40:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:52,206 INFO L225 Difference]: With dead ends: 33 [2021-12-22 11:40:52,206 INFO L226 Difference]: Without dead ends: 29 [2021-12-22 11:40:52,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:52,209 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:52,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:40:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-22 11:40:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-22 11:40:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-22 11:40:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-22 11:40:52,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-22 11:40:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:52,218 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-22 11:40:52,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:40:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-22 11:40:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 11:40:52,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:52,220 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:52,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 11:40:52,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-22 11:40:52,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:52,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437007434] [2021-12-22 11:40:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:52,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-22 11:40:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:52,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:52,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437007434] [2021-12-22 11:40:52,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437007434] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:52,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385826685] [2021-12-22 11:40:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:52,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:52,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:52,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 11:40:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:40:52,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:52,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:52,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385826685] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:52,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:52,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-22 11:40:52,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220616298] [2021-12-22 11:40:52,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:52,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 11:40:52,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 11:40:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:40:52,676 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-22 11:40:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:52,782 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-22 11:40:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 11:40:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-12-22 11:40:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:52,783 INFO L225 Difference]: With dead ends: 55 [2021-12-22 11:40:52,783 INFO L226 Difference]: Without dead ends: 31 [2021-12-22 11:40:52,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-22 11:40:52,785 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:52,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:40:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-22 11:40:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-22 11:40:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-22 11:40:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-22 11:40:52,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-22 11:40:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:52,789 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-22 11:40:52,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-22 11:40:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-22 11:40:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 11:40:52,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:52,791 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:52,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-22 11:40:53,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:53,023 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-22 11:40:53,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:53,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6665764] [2021-12-22 11:40:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:53,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:53,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:53,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6665764] [2021-12-22 11:40:53,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6665764] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:53,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507769940] [2021-12-22 11:40:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:53,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:53,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:53,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:53,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 11:40:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:40:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:53,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 11:40:53,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507769940] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:53,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:53,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-22 11:40:53,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192238291] [2021-12-22 11:40:53,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:53,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 11:40:53,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:53,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 11:40:53,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:40:53,303 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-22 11:40:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:53,418 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-22 11:40:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 11:40:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-12-22 11:40:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:53,421 INFO L225 Difference]: With dead ends: 51 [2021-12-22 11:40:53,421 INFO L226 Difference]: Without dead ends: 47 [2021-12-22 11:40:53,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-22 11:40:53,422 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:53,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:40:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-22 11:40:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-22 11:40:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-22 11:40:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-22 11:40:53,429 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-22 11:40:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:53,429 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-22 11:40:53,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-22 11:40:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-22 11:40:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 11:40:53,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:53,431 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:53,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:53,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-22 11:40:53,649 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-22 11:40:53,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360806668] [2021-12-22 11:40:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:53,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-22 11:40:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 11:40:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-22 11:40:53,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:53,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360806668] [2021-12-22 11:40:53,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360806668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:53,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806167456] [2021-12-22 11:40:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:53,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:53,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 11:40:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:40:53,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 11:40:53,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 11:40:54,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806167456] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:54,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:54,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-22 11:40:54,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158331487] [2021-12-22 11:40:54,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:54,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 11:40:54,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 11:40:54,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-22 11:40:54,223 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-22 11:40:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:54,401 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-22 11:40:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 11:40:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-22 11:40:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:54,403 INFO L225 Difference]: With dead ends: 105 [2021-12-22 11:40:54,403 INFO L226 Difference]: Without dead ends: 63 [2021-12-22 11:40:54,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-22 11:40:54,404 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:54,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:40:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-22 11:40:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-22 11:40:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-22 11:40:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-22 11:40:54,413 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-22 11:40:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:54,413 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-22 11:40:54,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-22 11:40:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-22 11:40:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 11:40:54,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:54,415 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:54,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:54,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:54,634 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-22 11:40:54,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861285244] [2021-12-22 11:40:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:54,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-22 11:40:54,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861285244] [2021-12-22 11:40:54,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861285244] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846022964] [2021-12-22 11:40:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:54,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:54,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:54,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 11:40:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:40:54,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-22 11:40:54,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 11:40:55,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846022964] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:55,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:55,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-22 11:40:55,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033957914] [2021-12-22 11:40:55,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:55,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 11:40:55,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 11:40:55,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-22 11:40:55,200 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-22 11:40:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:55,508 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-22 11:40:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:40:55,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-22 11:40:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:55,510 INFO L225 Difference]: With dead ends: 177 [2021-12-22 11:40:55,510 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 11:40:55,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-22 11:40:55,513 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:55,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 11:40:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-22 11:40:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-22 11:40:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-22 11:40:55,527 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-22 11:40:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:55,528 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-22 11:40:55,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-22 11:40:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-22 11:40:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-22 11:40:55,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:55,530 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:55,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:55,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:55,751 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-22 11:40:55,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:55,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554577398] [2021-12-22 11:40:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:55,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-22 11:40:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-22 11:40:55,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554577398] [2021-12-22 11:40:55,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554577398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241406076] [2021-12-22 11:40:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:55,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:55,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:55,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 11:40:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 11:40:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-22 11:40:56,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 11:40:56,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241406076] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:56,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:56,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-22 11:40:56,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146093206] [2021-12-22 11:40:56,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:56,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 11:40:56,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:56,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 11:40:56,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-22 11:40:56,456 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-22 11:40:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:56,810 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-22 11:40:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 11:40:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-22 11:40:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:56,812 INFO L225 Difference]: With dead ends: 255 [2021-12-22 11:40:56,812 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 11:40:56,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-22 11:40:56,814 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:56,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 11:40:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-22 11:40:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-22 11:40:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-22 11:40:56,830 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-22 11:40:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:56,831 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-22 11:40:56,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-22 11:40:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-22 11:40:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 11:40:56,834 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:56,834 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:56,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:57,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:57,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-22 11:40:57,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:57,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37349541] [2021-12-22 11:40:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:57,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 11:40:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-22 11:40:57,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:57,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37349541] [2021-12-22 11:40:57,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37349541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755938437] [2021-12-22 11:40:57,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:57,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:57,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:57,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 11:40:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:40:57,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-22 11:40:57,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-22 11:40:58,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755938437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:58,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:58,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-12-22 11:40:58,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283481970] [2021-12-22 11:40:58,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:58,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-22 11:40:58,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-22 11:40:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-22 11:40:58,175 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) [2021-12-22 11:40:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:58,533 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-22 11:40:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 11:40:58,533 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 [2021-12-22 11:40:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:58,536 INFO L225 Difference]: With dead ends: 240 [2021-12-22 11:40:58,536 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 11:40:58,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 11:40:58,538 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:58,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 11:40:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-22 11:40:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-22 11:40:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-22 11:40:58,556 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-22 11:40:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:58,556 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-22 11:40:58,556 INFO L471 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) [2021-12-22 11:40:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-22 11:40:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-22 11:40:58,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:58,563 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:58,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:58,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:58,780 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:58,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-22 11:40:58,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:58,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508119640] [2021-12-22 11:40:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:58,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 11:40:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-22 11:40:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-22 11:40:58,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:58,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508119640] [2021-12-22 11:40:58,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508119640] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:58,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135512468] [2021-12-22 11:40:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:58,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:58,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:40:58,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 11:40:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 11:40:59,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-22 11:40:59,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:41:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-12-22 11:41:00,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135512468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:41:00,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:41:00,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2021-12-22 11:41:00,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686275974] [2021-12-22 11:41:00,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:41:00,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-22 11:41:00,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:41:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-22 11:41:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-12-22 11:41:00,254 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) [2021-12-22 11:41:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:41:00,643 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-12-22 11:41:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-22 11:41:00,644 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 [2021-12-22 11:41:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:41:00,645 INFO L225 Difference]: With dead ends: 214 [2021-12-22 11:41:00,646 INFO L226 Difference]: Without dead ends: 134 [2021-12-22 11:41:00,647 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:41:00,647 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:41:00,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:41:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-22 11:41:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-22 11:41:00,673 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) [2021-12-22 11:41:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-12-22 11:41:00,676 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-12-22 11:41:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:41:00,677 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-12-22 11:41:00,677 INFO L471 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) [2021-12-22 11:41:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-12-22 11:41:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-22 11:41:00,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:41:00,683 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:41:00,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 11:41:00,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:00,898 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2021-12-22 11:41:00,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304411421] [2021-12-22 11:41:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:00,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:41:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 11:41:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-22 11:41:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 11:41:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2021-12-22 11:41:01,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:41:01,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304411421] [2021-12-22 11:41:01,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304411421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:41:01,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631278633] [2021-12-22 11:41:01,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 11:41:01,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:41:01,322 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:41:01,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 11:41:01,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 11:41:01,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:41:01,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 11:41:01,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:41:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2021-12-22 11:41:01,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:41:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2021-12-22 11:41:03,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631278633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:41:03,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:41:03,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2021-12-22 11:41:03,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014386977] [2021-12-22 11:41:03,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:41:03,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-22 11:41:03,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:41:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-22 11:41:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-12-22 11:41:03,747 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) [2021-12-22 11:41:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:41:04,219 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-12-22 11:41:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-22 11:41:04,220 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 [2021-12-22 11:41:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:41:04,222 INFO L225 Difference]: With dead ends: 260 [2021-12-22 11:41:04,222 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 11:41:04,223 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:41:04,223 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:41:04,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 354 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:41:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 11:41:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-12-22 11:41:04,231 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) [2021-12-22 11:41:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-12-22 11:41:04,232 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2021-12-22 11:41:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:41:04,233 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-12-22 11:41:04,233 INFO L471 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) [2021-12-22 11:41:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-12-22 11:41:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-22 11:41:04,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:41:04,238 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:41:04,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-22 11:41:04,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-22 11:41:04,452 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2021-12-22 11:41:04,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:04,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738733630] [2021-12-22 11:41:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:04,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:41:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 11:41:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-22 11:41:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-22 11:41:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:41:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2021-12-22 11:41:05,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:41:05,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738733630] [2021-12-22 11:41:05,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738733630] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:41:05,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41092798] [2021-12-22 11:41:05,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 11:41:05,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:05,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:41:05,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:41:05,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 11:41:05,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-22 11:41:05,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:41:05,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:41:05,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:41:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-22 11:41:05,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:41:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-22 11:41:06,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41092798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:41:06,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:41:06,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2021-12-22 11:41:06,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573120036] [2021-12-22 11:41:06,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:41:06,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 11:41:06,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:41:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 11:41:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-12-22 11:41:06,604 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) [2021-12-22 11:41:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:41:06,749 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2021-12-22 11:41:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 11:41:06,750 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 [2021-12-22 11:41:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:41:06,751 INFO L225 Difference]: With dead ends: 283 [2021-12-22 11:41:06,751 INFO L226 Difference]: Without dead ends: 147 [2021-12-22 11:41:06,752 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:41:06,753 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:41:06,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 199 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:41:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-22 11:41:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2021-12-22 11:41:06,758 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) [2021-12-22 11:41:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2021-12-22 11:41:06,759 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2021-12-22 11:41:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:41:06,759 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2021-12-22 11:41:06,759 INFO L471 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) [2021-12-22 11:41:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2021-12-22 11:41:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2021-12-22 11:41:06,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:41:06,765 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:41:06,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 11:41:06,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:06,978 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2021-12-22 11:41:06,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:06,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591016022] [2021-12-22 11:41:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:06,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:41:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:41:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-12-22 11:41:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:41:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2021-12-22 11:41:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2021-12-22 11:41:07,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:41:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591016022] [2021-12-22 11:41:07,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591016022] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:41:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106990595] [2021-12-22 11:41:07,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 11:41:07,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:07,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:41:07,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:41:08,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 11:41:08,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 11:41:08,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:41:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-22 11:41:08,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:41:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2021-12-22 11:41:08,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:41:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2021-12-22 11:41:11,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106990595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:41:11,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:41:11,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2021-12-22 11:41:11,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140377429] [2021-12-22 11:41:11,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:41:11,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-22 11:41:11,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:41:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-22 11:41:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2021-12-22 11:41:11,704 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) [2021-12-22 11:41:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:41:12,708 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2021-12-22 11:41:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-22 11:41:12,708 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 [2021-12-22 11:41:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:41:12,710 INFO L225 Difference]: With dead ends: 355 [2021-12-22 11:41:12,710 INFO L226 Difference]: Without dead ends: 183 [2021-12-22 11:41:12,712 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:41:12,713 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 169 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 11:41:12,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 717 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 11:41:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-22 11:41:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2021-12-22 11:41:12,718 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) [2021-12-22 11:41:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2021-12-22 11:41:12,720 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2021-12-22 11:41:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:41:12,720 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2021-12-22 11:41:12,720 INFO L471 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) [2021-12-22 11:41:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2021-12-22 11:41:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-12-22 11:41:12,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:41:12,725 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:41:12,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 11:41:12,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-22 11:41:12,949 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2021-12-22 11:41:12,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:12,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765209445] [2021-12-22 11:41:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:12,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:41:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:41:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-22 11:41:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-22 11:41:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:41:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:41:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:41:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:41:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:41:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:41:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:41:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2021-12-22 11:41:13,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:41:13,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765209445] [2021-12-22 11:41:13,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765209445] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:41:13,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207756933] [2021-12-22 11:41:13,670 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-22 11:41:13,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:41:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:41:13,684 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) [2021-12-22 11:41:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 11:41:13,905 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-22 11:41:13,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:41:13,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 11:41:13,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:41:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2021-12-22 11:41:14,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:41:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2021-12-22 11:41:16,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207756933] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:41:16,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:41:16,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2021-12-22 11:41:16,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747060611] [2021-12-22 11:41:16,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:41:16,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-22 11:41:16,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:41:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-22 11:41:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2021-12-22 11:41:16,189 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) [2021-12-22 11:41:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:41:16,650 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2021-12-22 11:41:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-22 11:41:16,650 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 [2021-12-22 11:41:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:41:16,653 INFO L225 Difference]: With dead ends: 333 [2021-12-22 11:41:16,653 INFO L226 Difference]: Without dead ends: 185 [2021-12-22 11:41:16,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2021-12-22 11:41:16,657 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:41:16,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 689 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:41:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-22 11:41:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2021-12-22 11:41:16,679 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) [2021-12-22 11:41:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2021-12-22 11:41:16,680 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2021-12-22 11:41:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:41:16,682 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2021-12-22 11:41:16,682 INFO L471 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) [2021-12-22 11:41:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2021-12-22 11:41:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-22 11:41:16,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:41:16,685 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:41:16,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-22 11:41:16,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-22 11:41:16,904 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-12-22 11:41:16,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064434952] [2021-12-22 11:41:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:16,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:41:16,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 11:41:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:41:17,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 11:41:17,129 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 11:41:17,130 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 11:41:17,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 11:41:17,134 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:41:17,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 11:41:17,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:41:17 BoogieIcfgContainer [2021-12-22 11:41:17,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 11:41:17,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 11:41:17,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 11:41:17,280 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 11:41:17,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:51" (3/4) ... [2021-12-22 11:41:17,282 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 11:41:17,366 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 11:41:17,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 11:41:17,367 INFO L158 Benchmark]: Toolchain (without parser) took 26363.44ms. Allocated memory was 100.7MB in the beginning and 308.3MB in the end (delta: 207.6MB). Free memory was 62.0MB in the beginning and 112.4MB in the end (delta: -50.5MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,367 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:41:17,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.10ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 52.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.16ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 50.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,368 INFO L158 Benchmark]: Boogie Preprocessor took 32.13ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 49.8MB in the end (delta: 920.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:41:17,368 INFO L158 Benchmark]: RCFGBuilder took 326.07ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 49.8MB in the beginning and 94.7MB in the end (delta: -44.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,369 INFO L158 Benchmark]: TraceAbstraction took 25722.63ms. Allocated memory was 121.6MB in the beginning and 308.3MB in the end (delta: 186.6MB). Free memory was 94.1MB in the beginning and 124.0MB in the end (delta: -29.9MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,370 INFO L158 Benchmark]: Witness Printer took 86.36ms. Allocated memory is still 308.3MB. Free memory was 124.0MB in the beginning and 112.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 11:41:17,371 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.16ms. Allocated memory is still 100.7MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.10ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 52.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.16ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 50.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.13ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 49.8MB in the end (delta: 920.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.07ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 49.8MB in the beginning and 94.7MB in the end (delta: -44.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25722.63ms. Allocated memory was 121.6MB in the beginning and 308.3MB in the end (delta: 186.6MB). Free memory was 94.1MB in the beginning and 124.0MB in the end (delta: -29.9MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. * Witness Printer took 86.36ms. Allocated memory is still 308.3MB. Free memory was 124.0MB in the beginning and 112.4MB in the end (delta: 11.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: 25.5s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1041 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 3728 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3318 mSDsCounter, 1215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5607 IncrementalHoareTripleChecker+Invalid, 6822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1215 mSolverCounterUnsat, 410 mSDtfsCounter, 5607 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.8s 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.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! [2021-12-22 11:41:17,427 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