./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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_10-1.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 faad93e560ba524ae1ece04545479d8bfc495d5f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:17:57,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:17:57,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:17:57,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:17:57,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:17:57,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:17:57,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:17:57,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:17:57,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:17:57,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:17:57,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:17:57,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:17:57,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:17:57,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:17:57,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:17:57,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:17:57,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:17:57,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:17:57,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:17:57,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:17:57,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:17:57,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:17:57,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:17:57,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:17:57,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:17:57,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:17:57,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:17:57,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:17:57,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:17:57,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:17:57,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:17:57,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:17:57,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:17:57,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:17:57,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:17:57,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:17:57,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:17:57,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:17:57,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:17:57,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:17:57,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:17:57,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:17:57,948 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:17:57,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:17:57,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:17:57,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:17:57,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:17:57,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:17:57,951 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:17:57,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:17:57,951 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:17:57,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:17:57,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:17:57,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:17:57,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:17:57,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:17:57,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:17:57,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:17:57,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:17:57,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:17:57,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:17:57,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:17:57,969 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 -> faad93e560ba524ae1ece04545479d8bfc495d5f [2021-08-29 16:17:58,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:17:58,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:17:58,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:17:58,227 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:17:58,227 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:17:58,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-08-29 16:17:58,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5b3390/28866d4f6a5a445f821383655542c9a7/FLAGa81d3f8ac [2021-08-29 16:17:58,645 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:17:58,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-08-29 16:17:58,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5b3390/28866d4f6a5a445f821383655542c9a7/FLAGa81d3f8ac [2021-08-29 16:17:58,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5b3390/28866d4f6a5a445f821383655542c9a7 [2021-08-29 16:17:58,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:17:58,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:17:58,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:17:58,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:17:58,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:17:58,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430e7f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58, skipping insertion in model container [2021-08-29 16:17:58,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:17:58,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:17:58,794 WARN L228 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_10-1.c[743,756] [2021-08-29 16:17:58,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:17:58,803 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:17:58,813 WARN L228 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_10-1.c[743,756] [2021-08-29 16:17:58,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:17:58,822 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:17:58,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58 WrapperNode [2021-08-29 16:17:58,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:17:58,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:17:58,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:17:58,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:17:58,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:17:58,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:17:58,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:17:58,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:17:58,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:17:58,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:17:58,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:17:58,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:17:58,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (1/1) ... [2021-08-29 16:17:58,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:17:58,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:58,918 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-08-29 16:17:58,951 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-08-29 16:17:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:17:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:17:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:17:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:17:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-08-29 16:17:58,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-08-29 16:17:59,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:17:59,065 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-29 16:17:59,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:59 BoogieIcfgContainer [2021-08-29 16:17:59,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:17:59,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:17:59,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:17:59,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:17:59,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:17:58" (1/3) ... [2021-08-29 16:17:59,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8a8476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:17:59, skipping insertion in model container [2021-08-29 16:17:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:17:58" (2/3) ... [2021-08-29 16:17:59,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8a8476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:17:59, skipping insertion in model container [2021-08-29 16:17:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:59" (3/3) ... [2021-08-29 16:17:59,071 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-08-29 16:17:59,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:17:59,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 16:17:59,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:17:59,108 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, mConcurrency=FINITE_AUTOMATA, 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-08-29 16:17:59,108 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 16:17:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-29 16:17:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 16:17:59,122 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:59,122 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:59,122 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-08-29 16:17:59,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:59,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141772859] [2021-08-29 16:17:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:59,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:17:59,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:59,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141772859] [2021-08-29 16:17:59,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141772859] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:17:59,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:17:59,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:17:59,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745204195] [2021-08-29 16:17:59,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:17:59,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:17:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:59,319 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-08-29 16:17:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:59,417 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-08-29 16:17:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:17:59,419 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-08-29 16:17:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:59,424 INFO L225 Difference]: With dead ends: 34 [2021-08-29 16:17:59,424 INFO L226 Difference]: Without dead ends: 18 [2021-08-29 16:17:59,427 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.72ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:59,432 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.34ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:59,433 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 67 Unknown, 0 Unchecked, 1.53ms Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 71.34ms Time] [2021-08-29 16:17:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-29 16:17:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-29 16:17:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:17:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:17:59,463 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-29 16:17:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:59,463 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:17:59,464 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-08-29 16:17:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:17:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 16:17:59,468 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:59,469 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:59,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:17:59,469 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:59,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-08-29 16:17:59,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:59,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291695970] [2021-08-29 16:17:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:59,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:17:59,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:59,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291695970] [2021-08-29 16:17:59,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291695970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:17:59,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:17:59,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:17:59,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451829013] [2021-08-29 16:17:59,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:17:59,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:17:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:17:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:59,528 INFO L87 Difference]: Start difference. First operand 18 states and 22 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-08-29 16:17:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:17:59,557 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-29 16:17:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:17:59,557 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-08-29 16:17:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:17:59,558 INFO L225 Difference]: With dead ends: 24 [2021-08-29 16:17:59,558 INFO L226 Difference]: Without dead ends: 20 [2021-08-29 16:17:59,559 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.82ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:17:59,560 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.74ms IncrementalHoareTripleChecker+Time [2021-08-29 16:17:59,560 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 24.74ms Time] [2021-08-29 16:17:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-29 16:17:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-29 16:17:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-29 16:17:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-29 16:17:59,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-29 16:17:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:17:59,565 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-29 16:17:59,565 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-08-29 16:17:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-29 16:17:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-29 16:17:59,566 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:17:59,566 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:17:59,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:17:59,566 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:17:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:17:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-08-29 16:17:59,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:17:59,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422158977] [2021-08-29 16:17:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:59,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:17:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:17:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:17:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-29 16:17:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:17:59,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:17:59,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422158977] [2021-08-29 16:17:59,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422158977] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:17:59,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677763864] [2021-08-29 16:17:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:17:59,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:17:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:17:59,707 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-08-29 16:17:59,727 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-08-29 16:17:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:17:59,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 16:17:59,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:17:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:17:59,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 16:18:00,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677763864] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:00,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:00,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-08-29 16:18:00,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915916433] [2021-08-29 16:18:00,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 16:18:00,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 16:18:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-29 16:18:00,127 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08-29 16:18:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:00,254 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-29 16:18:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 16:18:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08-29 16:18:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:00,257 INFO L225 Difference]: With dead ends: 35 [2021-08-29 16:18:00,257 INFO L226 Difference]: Without dead ends: 20 [2021-08-29 16:18:00,260 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 114.03ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-08-29 16:18:00,262 INFO L928 BasicCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.11ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.17ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:00,264 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 5 Invalid, 135 Unknown, 0 Unchecked, 4.11ms Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 68.17ms Time] [2021-08-29 16:18:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-29 16:18:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-29 16:18:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-29 16:18:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-29 16:18:00,268 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-29 16:18:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:00,269 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-29 16:18:00,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08-29 16:18:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-29 16:18:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-29 16:18:00,270 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:00,270 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:00,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-29 16:18:00,484 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-08-29 16:18:00,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-08-29 16:18:00,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:00,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484061611] [2021-08-29 16:18:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:00,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:18:00,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:00,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484061611] [2021-08-29 16:18:00,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484061611] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:00,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010617953] [2021-08-29 16:18:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:00,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:00,586 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-08-29 16:18:00,590 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-08-29 16:18:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:00,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 16:18:00,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:18:00,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 16:18:00,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010617953] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:00,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:00,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2021-08-29 16:18:00,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097364612] [2021-08-29 16:18:00,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 16:18:00,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 16:18:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-29 16:18:00,882 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-08-29 16:18:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:00,984 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-29 16:18:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 16:18:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-08-29 16:18:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:00,986 INFO L225 Difference]: With dead ends: 38 [2021-08-29 16:18:00,987 INFO L226 Difference]: Without dead ends: 34 [2021-08-29 16:18:00,988 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 48.93ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-08-29 16:18:00,989 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.54ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.27ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:00,989 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 148 Unknown, 0 Unchecked, 1.54ms Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 84.27ms Time] [2021-08-29 16:18:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-29 16:18:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-29 16:18:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-29 16:18:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-29 16:18:00,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-29 16:18:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:00,997 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-29 16:18:00,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-08-29 16:18:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-29 16:18:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 16:18:00,999 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:00,999 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:01,024 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-08-29 16:18:01,204 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-08-29 16:18:01,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-08-29 16:18:01,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:01,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183340454] [2021-08-29 16:18:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:01,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-29 16:18:01,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:01,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183340454] [2021-08-29 16:18:01,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183340454] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:01,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066327934] [2021-08-29 16:18:01,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 16:18:01,336 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:01,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:01,343 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-08-29 16:18:01,344 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-08-29 16:18:01,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 16:18:01,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:01,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 16:18:01,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-29 16:18:01,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-29 16:18:01,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066327934] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:01,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:01,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2021-08-29 16:18:01,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498112029] [2021-08-29 16:18:01,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-29 16:18:01,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-29 16:18:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-08-29 16:18:01,770 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2021-08-29 16:18:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:01,911 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-08-29 16:18:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-29 16:18:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2021-08-29 16:18:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:01,912 INFO L225 Difference]: With dead ends: 69 [2021-08-29 16:18:01,912 INFO L226 Difference]: Without dead ends: 38 [2021-08-29 16:18:01,913 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 115.25ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-08-29 16:18:01,913 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.38ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.50ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:01,914 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 5 Invalid, 246 Unknown, 0 Unchecked, 1.38ms Time], IncrementalHoareTripleChecker [52 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 93.50ms Time] [2021-08-29 16:18:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-29 16:18:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-29 16:18:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-29 16:18:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-08-29 16:18:01,918 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-08-29 16:18:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:01,918 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-08-29 16:18:01,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2021-08-29 16:18:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-08-29 16:18:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-29 16:18:01,920 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:01,920 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:01,940 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-08-29 16:18:02,136 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-08-29 16:18:02,137 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-08-29 16:18:02,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:02,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542413093] [2021-08-29 16:18:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:02,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-29 16:18:02,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:02,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542413093] [2021-08-29 16:18:02,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542413093] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:02,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078801435] [2021-08-29 16:18:02,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 16:18:02,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:02,287 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-08-29 16:18:02,288 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-08-29 16:18:02,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-29 16:18:02,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:02,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 16:18:02,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-29 16:18:02,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-08-29 16:18:02,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078801435] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:02,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:02,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2021-08-29 16:18:02,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722048834] [2021-08-29 16:18:02,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-29 16:18:02,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-29 16:18:02,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-08-29 16:18:02,725 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2021-08-29 16:18:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:02,858 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-08-29 16:18:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 16:18:02,859 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2021-08-29 16:18:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:02,865 INFO L225 Difference]: With dead ends: 85 [2021-08-29 16:18:02,866 INFO L226 Difference]: Without dead ends: 50 [2021-08-29 16:18:02,866 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 86.36ms TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-08-29 16:18:02,867 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.40ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.65ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:02,867 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 7 Invalid, 229 Unknown, 0 Unchecked, 1.40ms Time], IncrementalHoareTripleChecker [57 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 101.65ms Time] [2021-08-29 16:18:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-29 16:18:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-08-29 16:18:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-29 16:18:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-08-29 16:18:02,872 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-08-29 16:18:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:02,873 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-08-29 16:18:02,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2021-08-29 16:18:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-08-29 16:18:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-29 16:18:02,874 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:02,874 INFO L513 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:02,895 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-08-29 16:18:03,089 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-08-29 16:18:03,089 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-08-29 16:18:03,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:03,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657898490] [2021-08-29 16:18:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:03,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-29 16:18:03,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:03,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657898490] [2021-08-29 16:18:03,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657898490] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:03,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653134781] [2021-08-29 16:18:03,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 16:18:03,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:03,357 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-08-29 16:18:03,400 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-08-29 16:18:03,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 16:18:03,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:03,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-29 16:18:03,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-08-29 16:18:03,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-08-29 16:18:04,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653134781] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:04,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:04,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2021-08-29 16:18:04,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474913895] [2021-08-29 16:18:04,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-29 16:18:04,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-29 16:18:04,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-08-29 16:18:04,406 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2021-08-29 16:18:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:04,595 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-08-29 16:18:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 16:18:04,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2021-08-29 16:18:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:04,601 INFO L225 Difference]: With dead ends: 117 [2021-08-29 16:18:04,602 INFO L226 Difference]: Without dead ends: 113 [2021-08-29 16:18:04,602 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 82.84ms TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2021-08-29 16:18:04,603 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 132 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.45ms SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 155.87ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:04,603 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 7 Invalid, 365 Unknown, 0 Unchecked, 3.45ms Time], IncrementalHoareTripleChecker [177 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 155.87ms Time] [2021-08-29 16:18:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-29 16:18:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-29 16:18:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2021-08-29 16:18:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-08-29 16:18:04,630 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-08-29 16:18:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:04,632 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-08-29 16:18:04,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2021-08-29 16:18:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-08-29 16:18:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-08-29 16:18:04,638 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:04,639 INFO L513 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:04,658 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-08-29 16:18:04,856 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-08-29 16:18:04,856 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-08-29 16:18:04,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:04,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465690751] [2021-08-29 16:18:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:04,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-08-29 16:18:05,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:05,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465690751] [2021-08-29 16:18:05,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465690751] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:05,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825140731] [2021-08-29 16:18:05,188 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 16:18:05,188 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:05,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:05,189 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-08-29 16:18:05,190 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-08-29 16:18:05,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-08-29 16:18:05,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:05,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-29 16:18:05,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-08-29 16:18:05,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-08-29 16:18:07,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825140731] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:07,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:07,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2021-08-29 16:18:07,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043072602] [2021-08-29 16:18:07,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-29 16:18:07,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-29 16:18:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2021-08-29 16:18:07,009 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:18:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:07,455 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-08-29 16:18:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-29 16:18:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2021-08-29 16:18:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:07,458 INFO L225 Difference]: With dead ends: 193 [2021-08-29 16:18:07,458 INFO L226 Difference]: Without dead ends: 95 [2021-08-29 16:18:07,459 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 373.91ms TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2021-08-29 16:18:07,460 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 203 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.41ms SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 278.03ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:07,460 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 10 Invalid, 763 Unknown, 0 Unchecked, 3.41ms Time], IncrementalHoareTripleChecker [240 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 278.03ms Time] [2021-08-29 16:18:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-29 16:18:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-08-29 16:18:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2021-08-29 16:18:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-29 16:18:07,465 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-08-29 16:18:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:07,465 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-29 16:18:07,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2021-08-29 16:18:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-08-29 16:18:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-29 16:18:07,470 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:07,471 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:07,491 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-08-29 16:18:07,694 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-08-29 16:18:07,694 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2021-08-29 16:18:07,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:07,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837674711] [2021-08-29 16:18:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:07,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:07,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-08-29 16:18:08,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:08,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837674711] [2021-08-29 16:18:08,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837674711] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:08,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412985506] [2021-08-29 16:18:08,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-29 16:18:08,011 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:08,013 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-08-29 16:18:08,043 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-08-29 16:18:08,116 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-08-29 16:18:08,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:08,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-29 16:18:08,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2021-08-29 16:18:08,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 335 proven. 857 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2021-08-29 16:18:09,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412985506] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:09,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:09,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2021-08-29 16:18:09,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403750705] [2021-08-29 16:18:09,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-29 16:18:09,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-29 16:18:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2021-08-29 16:18:09,873 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2021-08-29 16:18:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:10,089 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2021-08-29 16:18:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-29 16:18:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) Word has length 283 [2021-08-29 16:18:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:10,092 INFO L225 Difference]: With dead ends: 266 [2021-08-29 16:18:10,092 INFO L226 Difference]: Without dead ends: 262 [2021-08-29 16:18:10,093 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 136.97ms TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2021-08-29 16:18:10,093 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 170 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 187.00ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:10,093 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 7 Invalid, 460 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [175 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 187.00ms Time] [2021-08-29 16:18:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-29 16:18:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2021-08-29 16:18:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 170 states have (on average 1.035294117647059) internal successors, (176), 165 states have internal predecessors, (176), 52 states have call successors, (52), 31 states have call predecessors, (52), 24 states have return successors, (140), 50 states have call predecessors, (140), 52 states have call successors, (140) [2021-08-29 16:18:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2021-08-29 16:18:10,107 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2021-08-29 16:18:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:10,108 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2021-08-29 16:18:10,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2021-08-29 16:18:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2021-08-29 16:18:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-08-29 16:18:10,113 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:10,113 INFO L513 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:10,132 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-08-29 16:18:10,324 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-08-29 16:18:10,325 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2021-08-29 16:18:10,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:10,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813231180] [2021-08-29 16:18:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:10,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:18:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-08-29 16:18:11,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:11,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813231180] [2021-08-29 16:18:11,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813231180] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:11,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354652881] [2021-08-29 16:18:11,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-29 16:18:11,190 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:11,196 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-08-29 16:18:11,197 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-08-29 16:18:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:11,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-29 16:18:11,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2021-08-29 16:18:12,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2766 refuted. 0 times theorem prover too weak. 13255 trivial. 0 not checked. [2021-08-29 16:18:14,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354652881] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:14,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:14,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2021-08-29 16:18:14,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005175301] [2021-08-29 16:18:14,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-29 16:18:14,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-29 16:18:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2021-08-29 16:18:14,640 INFO L87 Difference]: Start difference. First operand 247 states and 368 transitions. Second operand has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2021-08-29 16:18:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:15,267 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2021-08-29 16:18:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-29 16:18:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) Word has length 528 [2021-08-29 16:18:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:15,270 INFO L225 Difference]: With dead ends: 388 [2021-08-29 16:18:15,270 INFO L226 Difference]: Without dead ends: 152 [2021-08-29 16:18:15,272 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 421.48ms TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2021-08-29 16:18:15,272 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 223 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 334.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.42ms SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 409.78ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:15,272 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 13 Invalid, 1127 Unknown, 0 Unchecked, 4.42ms Time], IncrementalHoareTripleChecker [303 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 409.78ms Time] [2021-08-29 16:18:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-29 16:18:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2021-08-29 16:18:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 85 states have internal predecessors, (90), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (58), 17 states have call predecessors, (58), 24 states have call successors, (58) [2021-08-29 16:18:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2021-08-29 16:18:15,280 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2021-08-29 16:18:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:15,281 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2021-08-29 16:18:15,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2021-08-29 16:18:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2021-08-29 16:18:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2021-08-29 16:18:15,297 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:15,297 INFO L513 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:15,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 16:18:15,507 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-08-29 16:18:15,508 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2021-08-29 16:18:15,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:15,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926836205] [2021-08-29 16:18:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:15,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:18:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-29 16:18:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:18:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2021-08-29 16:18:16,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:16,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926836205] [2021-08-29 16:18:16,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926836205] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:16,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634954094] [2021-08-29 16:18:16,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 16:18:16,914 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:16,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:16,915 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-08-29 16:18:16,968 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-08-29 16:18:17,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 16:18:17,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:17,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1928 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-29 16:18:17,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2021-08-29 16:18:18,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5245 refuted. 0 times theorem prover too weak. 37670 trivial. 0 not checked. [2021-08-29 16:18:22,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634954094] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:22,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:22,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2021-08-29 16:18:22,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203839319] [2021-08-29 16:18:22,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-08-29 16:18:22,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-08-29 16:18:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2021-08-29 16:18:22,035 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2021-08-29 16:18:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:22,727 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2021-08-29 16:18:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-29 16:18:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) Word has length 855 [2021-08-29 16:18:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:22,740 INFO L225 Difference]: With dead ends: 270 [2021-08-29 16:18:22,740 INFO L226 Difference]: Without dead ends: 163 [2021-08-29 16:18:22,742 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1957 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 524.06ms TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2021-08-29 16:18:22,743 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 369 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 346.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.92ms SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 444.92ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:22,743 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 14 Invalid, 1467 Unknown, 0 Unchecked, 4.92ms Time], IncrementalHoareTripleChecker [660 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 444.92ms Time] [2021-08-29 16:18:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-29 16:18:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2021-08-29 16:18:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 97 states have internal predecessors, (102), 28 states have call successors, (28), 22 states have call predecessors, (28), 11 states have return successors, (71), 19 states have call predecessors, (71), 28 states have call successors, (71) [2021-08-29 16:18:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2021-08-29 16:18:22,754 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2021-08-29 16:18:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:22,756 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2021-08-29 16:18:22,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2021-08-29 16:18:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2021-08-29 16:18:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2021-08-29 16:18:22,777 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:22,777 INFO L513 BasicCegarLoop]: trace histogram [229, 229, 185, 114, 114, 114, 114, 114, 114, 114, 71, 44, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:22,798 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-08-29 16:18:22,992 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-08-29 16:18:22,993 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2021-08-29 16:18:22,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:22,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409949142] [2021-08-29 16:18:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:22,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-29 16:18:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:18:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-29 16:18:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-08-29 16:18:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-29 16:18:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-29 16:18:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-08-29 16:18:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2021-08-29 16:18:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-29 16:18:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-29 16:18:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-29 16:18:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-29 16:18:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-29 16:18:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-29 16:18:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:18:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 13165 proven. 14022 refuted. 0 times theorem prover too weak. 120021 trivial. 0 not checked. [2021-08-29 16:18:26,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:18:26,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409949142] [2021-08-29 16:18:26,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409949142] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:18:26,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469649293] [2021-08-29 16:18:26,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 16:18:26,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:18:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:18:26,192 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-08-29 16:18:26,220 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-08-29 16:18:26,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2021-08-29 16:18:26,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 16:18:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2094 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-29 16:18:26,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:18:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1070 refuted. 0 times theorem prover too weak. 135392 trivial. 0 not checked. [2021-08-29 16:18:28,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:18:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1120 refuted. 0 times theorem prover too weak. 135342 trivial. 0 not checked. [2021-08-29 16:18:33,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469649293] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:18:33,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:18:33,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2021-08-29 16:18:33,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510406375] [2021-08-29 16:18:33,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-29 16:18:33,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:18:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-29 16:18:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2021-08-29 16:18:33,805 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2021-08-29 16:18:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:18:34,718 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2021-08-29 16:18:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-29 16:18:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1563 [2021-08-29 16:18:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:18:34,721 INFO L225 Difference]: With dead ends: 319 [2021-08-29 16:18:34,721 INFO L226 Difference]: Without dead ends: 195 [2021-08-29 16:18:34,723 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3580 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 694.16ms TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2021-08-29 16:18:34,724 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 376 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 473.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.19ms SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 589.74ms IncrementalHoareTripleChecker+Time [2021-08-29 16:18:34,724 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 16 Invalid, 1777 Unknown, 0 Unchecked, 5.19ms Time], IncrementalHoareTripleChecker [609 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 589.74ms Time] [2021-08-29 16:18:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-29 16:18:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2021-08-29 16:18:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 110 states have internal predecessors, (115), 33 states have call successors, (33), 26 states have call predecessors, (33), 11 states have return successors, (84), 20 states have call predecessors, (84), 33 states have call successors, (84) [2021-08-29 16:18:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2021-08-29 16:18:34,734 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2021-08-29 16:18:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:18:34,734 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2021-08-29 16:18:34,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2021-08-29 16:18:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2021-08-29 16:18:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-08-29 16:18:34,742 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:18:34,742 INFO L513 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:18:34,764 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-08-29 16:18:34,951 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-08-29 16:18:34,951 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:18:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:18:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-08-29 16:18:34,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:18:34,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477702409] [2021-08-29 16:18:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:18:34,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:18:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:18:35,128 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 16:18:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:18:35,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 16:18:35,530 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 16:18:35,530 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 16:18:35,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 16:18:35,537 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:18:35,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:18:35 BoogieIcfgContainer [2021-08-29 16:18:35,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:18:35,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:18:35,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:18:35,674 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:18:35,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:17:59" (3/4) ... [2021-08-29 16:18:35,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 16:18:35,835 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:18:35,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:18:35,836 INFO L158 Benchmark]: Toolchain (without parser) took 37159.73ms. Allocated memory was 73.4MB in the beginning and 499.1MB in the end (delta: 425.7MB). Free memory was 58.2MB in the beginning and 438.0MB in the end (delta: -379.8MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,836 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 73.4MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:18:35,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.35ms. Allocated memory is still 73.4MB. Free memory was 58.2MB in the beginning and 48.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.47ms. Allocated memory is still 73.4MB. Free memory was 48.9MB in the beginning and 57.4MB in the end (delta: -8.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,837 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 73.4MB. Free memory was 57.4MB in the beginning and 56.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,837 INFO L158 Benchmark]: RCFGBuilder took 172.00ms. Allocated memory is still 73.4MB. Free memory was 56.3MB in the beginning and 47.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,838 INFO L158 Benchmark]: TraceAbstraction took 36606.03ms. Allocated memory was 73.4MB in the beginning and 415.2MB in the end (delta: 341.8MB). Free memory was 47.4MB in the beginning and 179.2MB in the end (delta: -131.8MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,838 INFO L158 Benchmark]: Witness Printer took 162.13ms. Allocated memory was 415.2MB in the beginning and 499.1MB in the end (delta: 83.9MB). Free memory was 179.2MB in the beginning and 438.0MB in the end (delta: -258.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2021-08-29 16:18:35,839 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.15ms. Allocated memory is still 73.4MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.35ms. Allocated memory is still 73.4MB. Free memory was 58.2MB in the beginning and 48.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.47ms. Allocated memory is still 73.4MB. Free memory was 48.9MB in the beginning and 57.4MB in the end (delta: -8.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 73.4MB. Free memory was 57.4MB in the beginning and 56.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 172.00ms. Allocated memory is still 73.4MB. Free memory was 56.3MB in the beginning and 47.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36606.03ms. Allocated memory was 73.4MB in the beginning and 415.2MB in the end (delta: 341.8MB). Free memory was 47.4MB in the beginning and 179.2MB in the end (delta: -131.8MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. * Witness Printer took 162.13ms. Allocated memory was 415.2MB in the beginning and 499.1MB in the end (delta: 83.9MB). Free memory was 179.2MB in the beginning and 438.0MB in the end (delta: -258.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36432.26ms, OverallIterations: 13, TraceHistogramMax: 229, EmptinessCheckTime: 71.55ms, AutomataDifference: 3846.37ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.67ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 2509.00ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1981.25ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1222 mSDsCounter, 2311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4527 IncrementalHoareTripleChecker+Invalid, 6838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2311 mSolverCounterUnsat, 87 mSDtfsCounter, 4527 mSolverCounterSat, 34.89ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8889 GetRequests, 8504 SyntacticMatches, 17 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6064 ImplicationChecksByTransitivity, 2625.53ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 113.23ms AutomataMinimizationTime, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 221.80ms SsaConstructionTime, 1498.24ms SatisfiabilityAnalysisTime, 27439.62ms InterpolantComputationTime, 8710 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 11209 ConstructedInterpolants, 0 QuantifiedInterpolants, 15429 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6619 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 600612/647382 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-08-29 16:18:35,888 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...