./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:43:17,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:43:17,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:43:17,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:43:17,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:43:17,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:43:17,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:43:17,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:43:17,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:43:17,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:43:17,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:43:17,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:43:17,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:43:17,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:43:17,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:43:17,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:43:17,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:43:17,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:43:17,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:43:17,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:43:17,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:43:17,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:43:17,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:43:17,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:43:17,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:43:17,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:43:17,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:43:17,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:43:17,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:43:17,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:43:17,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:43:17,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:43:17,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:43:17,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:43:17,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:43:17,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:43:17,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:43:17,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:43:17,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:43:17,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:43:17,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:43:17,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:43:17,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:43:17,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:43:17,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:43:17,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:43:17,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:43:17,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:43:17,277 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:43:17,277 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:43:17,277 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:43:17,277 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:43:17,278 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:43:17,278 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:43:17,278 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:43:17,278 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:43:17,279 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:43:17,279 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:43:17,279 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:43:17,280 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:43:17,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:43:17,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:43:17,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:43:17,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:43:17,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:43:17,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:43:17,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:43:17,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:43:17,282 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:43:17,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:43:17,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:43:17,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:43:17,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:43:17,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:43:17,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:43:17,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:43:17,284 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:43:17,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:43:17,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:43:17,285 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:43:17,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:43:17,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:43:17,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:43:17,286 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2022-11-23 13:43:17,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:43:17,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:43:17,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:43:17,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:43:17,577 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:43:17,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2022-11-23 13:43:20,677 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:43:20,856 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:43:20,856 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2022-11-23 13:43:20,865 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/data/79a67d4a1/a7136c39854c4176adcbc573db1bbb13/FLAG39b1307c1 [2022-11-23 13:43:20,882 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/data/79a67d4a1/a7136c39854c4176adcbc573db1bbb13 [2022-11-23 13:43:20,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:43:20,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:43:20,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:43:20,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:43:20,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:43:20,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:20" (1/1) ... [2022-11-23 13:43:20,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a0a1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:20, skipping insertion in model container [2022-11-23 13:43:20,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:20" (1/1) ... [2022-11-23 13:43:20,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:43:20,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:43:21,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2022-11-23 13:43:21,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:43:21,145 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:43:21,159 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2022-11-23 13:43:21,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:43:21,173 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:43:21,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21 WrapperNode [2022-11-23 13:43:21,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:43:21,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:43:21,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:43:21,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:43:21,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,201 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-23 13:43:21,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:43:21,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:43:21,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:43:21,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:43:21,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:43:21,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:43:21,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:43:21,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:43:21,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (1/1) ... [2022-11-23 13:43:21,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:43:21,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:21,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:43:21,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:43:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:43:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:43:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-11-23 13:43:21,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-11-23 13:43:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-11-23 13:43:21,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-11-23 13:43:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:43:21,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:43:21,389 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:43:21,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:43:21,611 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:43:21,665 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:43:21,666 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:43:21,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:21 BoogieIcfgContainer [2022-11-23 13:43:21,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:43:21,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:43:21,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:43:21,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:43:21,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:43:20" (1/3) ... [2022-11-23 13:43:21,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:21, skipping insertion in model container [2022-11-23 13:43:21,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:21" (2/3) ... [2022-11-23 13:43:21,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:21, skipping insertion in model container [2022-11-23 13:43:21,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:21" (3/3) ... [2022-11-23 13:43:21,677 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2022-11-23 13:43:21,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:43:21,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 13:43:21,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:43:21,779 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12b32db8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:43:21,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 13:43:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 13:43:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:43:21,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:21,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:21,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2022-11-23 13:43:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:21,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920173488] [2022-11-23 13:43:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:43:22,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:22,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920173488] [2022-11-23 13:43:22,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920173488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:43:22,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:43:22,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:43:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071120895] [2022-11-23 13:43:22,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:43:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:43:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:43:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:43:22,088 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:43:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:22,192 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-23 13:43:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:43:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2022-11-23 13:43:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:22,204 INFO L225 Difference]: With dead ends: 36 [2022-11-23 13:43:22,211 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 13:43:22,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:43:22,221 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:22,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:43:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 13:43:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-23 13:43:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 13:43:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-23 13:43:22,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-11-23 13:43:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:22,263 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 13:43:22,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:43:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-23 13:43:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:43:22,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:22,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:22,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:43:22,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2022-11-23 13:43:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206139779] [2022-11-23 13:43:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:43:22,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:22,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206139779] [2022-11-23 13:43:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206139779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:43:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:43:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:43:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845305767] [2022-11-23 13:43:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:43:22,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:43:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:43:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:43:22,365 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:43:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:22,408 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-11-23 13:43:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:43:22,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-23 13:43:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:22,411 INFO L225 Difference]: With dead ends: 32 [2022-11-23 13:43:22,411 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 13:43:22,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:43:22,413 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:22,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:43:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 13:43:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-23 13:43:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 13:43:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-23 13:43:22,422 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2022-11-23 13:43:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:22,423 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 13:43:22,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:43:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-23 13:43:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 13:43:22,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:22,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:22,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:43:22,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2022-11-23 13:43:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:22,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005623732] [2022-11-23 13:43:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:43:22,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005623732] [2022-11-23 13:43:22,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005623732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114300175] [2022-11-23 13:43:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:22,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:22,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:43:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:22,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:43:22,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:43:22,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:43:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114300175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:23,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723050728] [2022-11-23 13:43:23,125 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-23 13:43:23,126 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:23,131 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:43:23,137 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:43:23,137 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:43:23,279 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2022-11-23 13:43:23,341 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2022-11-23 13:43:23,350 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:43:23,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [723050728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:43:23,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:23,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2022-11-23 13:43:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439755809] [2022-11-23 13:43:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:43:23,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:43:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:23,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:43:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:43:23,678 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 13:43:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:23,806 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-11-23 13:43:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:43:23,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-11-23 13:43:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:23,808 INFO L225 Difference]: With dead ends: 68 [2022-11-23 13:43:23,809 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 13:43:23,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:43:23,811 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:23,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:43:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 13:43:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-11-23 13:43:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-23 13:43:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-23 13:43:23,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2022-11-23 13:43:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:23,825 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-23 13:43:23,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 13:43:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-23 13:43:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 13:43:23,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:23,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:23,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:24,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:24,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2022-11-23 13:43:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:24,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672352473] [2022-11-23 13:43:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:43:24,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672352473] [2022-11-23 13:43:24,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672352473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452579628] [2022-11-23 13:43:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:24,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:24,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:43:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:24,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:43:24,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 13:43:24,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 13:43:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452579628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018535059] [2022-11-23 13:43:24,773 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:24,773 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:24,774 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:24,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:24,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2022-11-23 13:43:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507577347] [2022-11-23 13:43:24,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:43:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:43:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:43:24,784 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:43:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:25,033 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-11-23 13:43:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:43:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2022-11-23 13:43:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:25,035 INFO L225 Difference]: With dead ends: 85 [2022-11-23 13:43:25,036 INFO L226 Difference]: Without dead ends: 53 [2022-11-23 13:43:25,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:43:25,038 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:25,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 94 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:43:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-23 13:43:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-23 13:43:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-23 13:43:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-11-23 13:43:25,051 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2022-11-23 13:43:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:25,051 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-11-23 13:43:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:43:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-11-23 13:43:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 13:43:25,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:25,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:25,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:25,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2022-11-23 13:43:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118592175] [2022-11-23 13:43:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 13:43:25,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118592175] [2022-11-23 13:43:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118592175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925703959] [2022-11-23 13:43:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:25,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:25,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:25,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:43:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:25,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:43:25,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:43:25,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 13:43:26,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925703959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:26,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292012182] [2022-11-23 13:43:26,154 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:26,155 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:26,156 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:26,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:26,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-11-23 13:43:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869402870] [2022-11-23 13:43:26,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:43:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:43:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:43:26,160 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:43:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:26,727 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2022-11-23 13:43:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:43:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-11-23 13:43:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:26,742 INFO L225 Difference]: With dead ends: 121 [2022-11-23 13:43:26,742 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 13:43:26,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:43:26,748 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:26,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 198 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:43:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 13:43:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-23 13:43:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-11-23 13:43:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2022-11-23 13:43:26,781 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2022-11-23 13:43:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:26,782 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2022-11-23 13:43:26,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:43:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2022-11-23 13:43:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 13:43:26,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:26,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:26,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:27,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2022-11-23 13:43:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:27,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559238267] [2022-11-23 13:43:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 13:43:27,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559238267] [2022-11-23 13:43:27,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559238267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:27,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351770550] [2022-11-23 13:43:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:27,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:27,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:27,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:43:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:27,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 13:43:27,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 13:43:27,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 13:43:27,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351770550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:27,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987131702] [2022-11-23 13:43:27,905 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:27,905 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:27,906 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:27,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:27,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2022-11-23 13:43:27,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493884570] [2022-11-23 13:43:27,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:27,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:43:27,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:43:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:43:27,909 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 13:43:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:28,179 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2022-11-23 13:43:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:43:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2022-11-23 13:43:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:28,182 INFO L225 Difference]: With dead ends: 119 [2022-11-23 13:43:28,182 INFO L226 Difference]: Without dead ends: 97 [2022-11-23 13:43:28,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:43:28,184 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:28,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 94 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-23 13:43:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-11-23 13:43:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2022-11-23 13:43:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2022-11-23 13:43:28,204 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2022-11-23 13:43:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:28,204 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2022-11-23 13:43:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 13:43:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-11-23 13:43:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-23 13:43:28,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:28,207 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:28,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:28,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:28,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2022-11-23 13:43:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987062469] [2022-11-23 13:43:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-23 13:43:28,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987062469] [2022-11-23 13:43:28,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987062469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:28,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215855151] [2022-11-23 13:43:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:28,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:28,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:43:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:28,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:43:28,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-23 13:43:28,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-23 13:43:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215855151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646300695] [2022-11-23 13:43:29,924 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:29,924 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:29,924 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:29,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:29,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-11-23 13:43:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626287183] [2022-11-23 13:43:29,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:29,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 13:43:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 13:43:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:43:29,928 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-23 13:43:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:30,845 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2022-11-23 13:43:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 13:43:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2022-11-23 13:43:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:30,848 INFO L225 Difference]: With dead ends: 204 [2022-11-23 13:43:30,848 INFO L226 Difference]: Without dead ends: 115 [2022-11-23 13:43:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 13:43:30,850 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 138 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:30,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 267 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:43:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-23 13:43:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-11-23 13:43:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2022-11-23 13:43:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2022-11-23 13:43:30,877 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2022-11-23 13:43:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:30,878 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2022-11-23 13:43:30,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-23 13:43:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2022-11-23 13:43:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-23 13:43:30,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:30,882 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:30,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:31,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:31,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2022-11-23 13:43:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:31,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148716201] [2022-11-23 13:43:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-11-23 13:43:31,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:31,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148716201] [2022-11-23 13:43:31,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148716201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:31,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505162943] [2022-11-23 13:43:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:31,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:31,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:31,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:31,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:43:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:43:31,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-11-23 13:43:31,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-23 13:43:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505162943] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:32,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452547844] [2022-11-23 13:43:32,885 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:32,885 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:32,885 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:32,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:32,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2022-11-23 13:43:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240490322] [2022-11-23 13:43:32,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:32,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:43:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:43:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:43:32,889 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:43:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:33,255 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2022-11-23 13:43:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:43:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 130 [2022-11-23 13:43:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:33,258 INFO L225 Difference]: With dead ends: 191 [2022-11-23 13:43:33,258 INFO L226 Difference]: Without dead ends: 103 [2022-11-23 13:43:33,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 241 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:43:33,260 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:33,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 143 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-23 13:43:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-11-23 13:43:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2022-11-23 13:43:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2022-11-23 13:43:33,275 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2022-11-23 13:43:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:33,275 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2022-11-23 13:43:33,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:43:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2022-11-23 13:43:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-23 13:43:33,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:33,278 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:33,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:33,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2022-11-23 13:43:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:33,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827715568] [2022-11-23 13:43:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-23 13:43:33,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827715568] [2022-11-23 13:43:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827715568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072534630] [2022-11-23 13:43:33,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:43:33,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:33,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:33,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:43:33,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 13:43:33,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:43:33,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:43:33,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-23 13:43:33,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-11-23 13:43:34,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072534630] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:34,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1506376279] [2022-11-23 13:43:34,367 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:34,368 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:34,368 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:34,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:34,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2022-11-23 13:43:34,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030229454] [2022-11-23 13:43:34,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:43:34,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:43:34,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:43:34,372 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-11-23 13:43:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:34,620 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2022-11-23 13:43:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:43:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2022-11-23 13:43:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:34,622 INFO L225 Difference]: With dead ends: 132 [2022-11-23 13:43:34,623 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 13:43:34,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:43:34,624 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:34,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 129 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 13:43:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2022-11-23 13:43:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2022-11-23 13:43:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2022-11-23 13:43:34,646 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2022-11-23 13:43:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:34,647 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2022-11-23 13:43:34,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-11-23 13:43:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2022-11-23 13:43:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-23 13:43:34,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:34,657 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:34,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 13:43:34,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:34,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2022-11-23 13:43:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:34,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060280263] [2022-11-23 13:43:34,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-11-23 13:43:35,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:35,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060280263] [2022-11-23 13:43:35,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060280263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:35,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200609680] [2022-11-23 13:43:35,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:43:35,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:35,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:35,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:35,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:43:35,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:43:35,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:43:35,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 13:43:35,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2022-11-23 13:43:35,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-11-23 13:43:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200609680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1294528873] [2022-11-23 13:43:36,273 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:36,273 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:36,274 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:36,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:36,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2022-11-23 13:43:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961285683] [2022-11-23 13:43:36,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:43:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:43:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:43:36,279 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-23 13:43:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:36,528 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2022-11-23 13:43:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:43:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2022-11-23 13:43:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:36,530 INFO L225 Difference]: With dead ends: 213 [2022-11-23 13:43:36,530 INFO L226 Difference]: Without dead ends: 113 [2022-11-23 13:43:36,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:43:36,532 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:36,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 151 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-23 13:43:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-23 13:43:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2022-11-23 13:43:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2022-11-23 13:43:36,547 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2022-11-23 13:43:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:36,547 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2022-11-23 13:43:36,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-23 13:43:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2022-11-23 13:43:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-11-23 13:43:36,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:36,554 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:36,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:36,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 13:43:36,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2022-11-23 13:43:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884803924] [2022-11-23 13:43:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2022-11-23 13:43:37,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884803924] [2022-11-23 13:43:37,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884803924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74818634] [2022-11-23 13:43:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:37,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:37,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:43:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:37,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:43:37,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2022-11-23 13:43:37,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-11-23 13:43:38,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74818634] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803692962] [2022-11-23 13:43:38,873 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:38,873 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:38,874 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:38,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2022-11-23 13:43:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852829264] [2022-11-23 13:43:38,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:38,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:43:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:43:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:43:38,880 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 13:43:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:39,123 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2022-11-23 13:43:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:43:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2022-11-23 13:43:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:39,126 INFO L225 Difference]: With dead ends: 142 [2022-11-23 13:43:39,126 INFO L226 Difference]: Without dead ends: 128 [2022-11-23 13:43:39,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:43:39,127 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:39,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 106 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-23 13:43:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2022-11-23 13:43:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2022-11-23 13:43:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2022-11-23 13:43:39,145 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2022-11-23 13:43:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:39,146 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2022-11-23 13:43:39,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 13:43:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2022-11-23 13:43:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-23 13:43:39,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:39,151 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:39,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:39,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:39,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2022-11-23 13:43:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:39,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116182974] [2022-11-23 13:43:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2022-11-23 13:43:39,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116182974] [2022-11-23 13:43:39,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116182974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577842378] [2022-11-23 13:43:39,992 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:43:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:39,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:40,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:43:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:40,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:43:40,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2022-11-23 13:43:40,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2022-11-23 13:43:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577842378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [655014262] [2022-11-23 13:43:42,547 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:42,548 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:42,548 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:42,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:42,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 32 [2022-11-23 13:43:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080895460] [2022-11-23 13:43:42,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:42,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 13:43:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 13:43:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-11-23 13:43:42,552 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2022-11-23 13:43:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:44,336 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2022-11-23 13:43:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 13:43:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) Word has length 239 [2022-11-23 13:43:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:44,340 INFO L225 Difference]: With dead ends: 300 [2022-11-23 13:43:44,340 INFO L226 Difference]: Without dead ends: 182 [2022-11-23 13:43:44,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 460 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=590, Invalid=3570, Unknown=0, NotChecked=0, Total=4160 [2022-11-23 13:43:44,344 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:44,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 464 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 13:43:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-23 13:43:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2022-11-23 13:43:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2022-11-23 13:43:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2022-11-23 13:43:44,367 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2022-11-23 13:43:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:44,372 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2022-11-23 13:43:44,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2022-11-23 13:43:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2022-11-23 13:43:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2022-11-23 13:43:44,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:44,425 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 54, 53, 53, 39, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 14, 12, 6, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:44,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:44,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 13:43:44,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash 480742356, now seen corresponding path program 5 times [2022-11-23 13:43:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:44,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403423668] [2022-11-23 13:43:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 279 proven. 1809 refuted. 0 times theorem prover too weak. 17588 trivial. 0 not checked. [2022-11-23 13:43:45,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:45,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403423668] [2022-11-23 13:43:45,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403423668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:45,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237956416] [2022-11-23 13:43:45,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:43:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:45,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:45,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:46,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:43:46,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:43:46,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:43:46,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:43:46,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2022-11-23 13:43:46,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2022-11-23 13:43:48,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237956416] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:48,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805385548] [2022-11-23 13:43:48,490 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:48,490 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:48,490 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:48,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-11-23 13:43:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766798084] [2022-11-23 13:43:48,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:48,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:43:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:43:48,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:43:48,495 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-23 13:43:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:48,952 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2022-11-23 13:43:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:43:48,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 810 [2022-11-23 13:43:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:48,955 INFO L225 Difference]: With dead ends: 351 [2022-11-23 13:43:48,955 INFO L226 Difference]: Without dead ends: 202 [2022-11-23 13:43:48,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1647 GetRequests, 1616 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:43:48,958 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:48,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 122 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:43:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-23 13:43:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2022-11-23 13:43:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2022-11-23 13:43:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2022-11-23 13:43:48,981 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 810 [2022-11-23 13:43:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:48,982 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2022-11-23 13:43:48,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-23 13:43:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2022-11-23 13:43:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-11-23 13:43:48,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:48,992 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 31, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 14, 10, 8, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:49,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:49,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1895528608, now seen corresponding path program 6 times [2022-11-23 13:43:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:49,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696156718] [2022-11-23 13:43:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 332 proven. 971 refuted. 0 times theorem prover too weak. 4867 trivial. 0 not checked. [2022-11-23 13:43:49,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696156718] [2022-11-23 13:43:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696156718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:49,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987002046] [2022-11-23 13:43:49,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:43:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:49,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:49,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:43:50,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:43:50,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:43:50,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:43:50,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 1749 proven. 32 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2022-11-23 13:43:50,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 259 proven. 1006 refuted. 0 times theorem prover too weak. 4905 trivial. 0 not checked. [2022-11-23 13:43:52,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987002046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [626559736] [2022-11-23 13:43:52,269 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:52,269 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:52,269 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:52,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:52,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 25 [2022-11-23 13:43:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572322499] [2022-11-23 13:43:52,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:52,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 13:43:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 13:43:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:43:52,272 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) [2022-11-23 13:43:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:53,191 INFO L93 Difference]: Finished difference Result 342 states and 581 transitions. [2022-11-23 13:43:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:43:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) Word has length 462 [2022-11-23 13:43:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:53,194 INFO L225 Difference]: With dead ends: 342 [2022-11-23 13:43:53,194 INFO L226 Difference]: Without dead ends: 162 [2022-11-23 13:43:53,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 910 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 13:43:53,196 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 116 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:53,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 306 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:43:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-23 13:43:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2022-11-23 13:43:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.0818181818181818) internal successors, (119), 105 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 17 states have return successors, (59), 29 states have call predecessors, (59), 29 states have call successors, (59) [2022-11-23 13:43:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2022-11-23 13:43:53,211 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 462 [2022-11-23 13:43:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:53,212 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2022-11-23 13:43:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) [2022-11-23 13:43:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2022-11-23 13:43:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-11-23 13:43:53,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:53,223 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 36, 36, 30, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 7, 7, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:53,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:53,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 13:43:53,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1957614995, now seen corresponding path program 7 times [2022-11-23 13:43:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:53,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070996123] [2022-11-23 13:43:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1230 refuted. 0 times theorem prover too weak. 5810 trivial. 0 not checked. [2022-11-23 13:43:54,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:43:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070996123] [2022-11-23 13:43:54,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070996123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:43:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941032777] [2022-11-23 13:43:54,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:43:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:43:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:43:54,244 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:43:54,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:43:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:43:54,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:43:54,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:43:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1230 refuted. 0 times theorem prover too weak. 5810 trivial. 0 not checked. [2022-11-23 13:43:54,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:43:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1263 refuted. 0 times theorem prover too weak. 5777 trivial. 0 not checked. [2022-11-23 13:43:57,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941032777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:43:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018710183] [2022-11-23 13:43:57,856 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:43:57,856 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:43:57,858 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:43:57,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:43:57,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 22 [2022-11-23 13:43:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685669193] [2022-11-23 13:43:57,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:43:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 13:43:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:43:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 13:43:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-23 13:43:57,864 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-23 13:43:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:43:58,204 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2022-11-23 13:43:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 13:43:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) Word has length 500 [2022-11-23 13:43:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:43:58,209 INFO L225 Difference]: With dead ends: 184 [2022-11-23 13:43:58,209 INFO L226 Difference]: Without dead ends: 170 [2022-11-23 13:43:58,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 989 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:43:58,210 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 81 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:43:58,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 140 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:43:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-23 13:43:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2022-11-23 13:43:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 107 states have internal predecessors, (121), 29 states have call successors, (29), 22 states have call predecessors, (29), 18 states have return successors, (61), 30 states have call predecessors, (61), 29 states have call successors, (61) [2022-11-23 13:43:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2022-11-23 13:43:58,248 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 500 [2022-11-23 13:43:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:43:58,251 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2022-11-23 13:43:58,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-23 13:43:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2022-11-23 13:43:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2022-11-23 13:43:58,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:43:58,257 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 48, 48, 41, 39, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 17, 14, 10, 9, 1, 1, 1, 1, 1, 1] [2022-11-23 13:43:58,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:43:58,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 13:43:58,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:43:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:43:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -93142244, now seen corresponding path program 8 times [2022-11-23 13:43:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:43:58,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129187018] [2022-11-23 13:43:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:43:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:43:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1308 proven. 1823 refuted. 0 times theorem prover too weak. 10346 trivial. 0 not checked. [2022-11-23 13:44:00,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129187018] [2022-11-23 13:44:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129187018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229764354] [2022-11-23 13:44:00,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:44:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:00,055 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:00,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 13:44:00,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-11-23 13:44:00,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:44:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:44:00,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1069 proven. 161 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2022-11-23 13:44:00,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1069 proven. 173 refuted. 0 times theorem prover too weak. 12235 trivial. 0 not checked. [2022-11-23 13:44:02,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229764354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:02,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [743411091] [2022-11-23 13:44:02,869 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:02,869 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:02,871 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:02,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:02,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 13] total 33 [2022-11-23 13:44:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730889047] [2022-11-23 13:44:02,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:02,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 13:44:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 13:44:02,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:44:02,877 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) [2022-11-23 13:44:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:04,570 INFO L93 Difference]: Finished difference Result 390 states and 609 transitions. [2022-11-23 13:44:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-23 13:44:04,571 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) Word has length 677 [2022-11-23 13:44:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:04,575 INFO L225 Difference]: With dead ends: 390 [2022-11-23 13:44:04,575 INFO L226 Difference]: Without dead ends: 236 [2022-11-23 13:44:04,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1345 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=644, Invalid=4326, Unknown=0, NotChecked=0, Total=4970 [2022-11-23 13:44:04,578 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 254 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:04,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 395 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:44:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-23 13:44:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 200. [2022-11-23 13:44:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 135 states have internal predecessors, (152), 39 states have call successors, (39), 29 states have call predecessors, (39), 20 states have return successors, (88), 35 states have call predecessors, (88), 39 states have call successors, (88) [2022-11-23 13:44:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2022-11-23 13:44:04,604 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 677 [2022-11-23 13:44:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:04,605 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2022-11-23 13:44:04,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) [2022-11-23 13:44:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2022-11-23 13:44:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2022-11-23 13:44:04,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:04,616 INFO L195 NwaCegarLoop]: trace histogram [81, 81, 76, 76, 65, 62, 40, 40, 40, 40, 40, 40, 40, 38, 38, 38, 38, 38, 38, 38, 27, 22, 16, 14, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:04,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:04,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 13:44:04,822 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1824353437, now seen corresponding path program 9 times [2022-11-23 13:44:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:04,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416047377] [2022-11-23 13:44:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 419 proven. 3305 refuted. 0 times theorem prover too weak. 30539 trivial. 0 not checked. [2022-11-23 13:44:06,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416047377] [2022-11-23 13:44:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416047377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708524770] [2022-11-23 13:44:06,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:44:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:06,719 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:06,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 13:44:07,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:44:07,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:44:07,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 13:44:07,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 18229 proven. 1897 refuted. 0 times theorem prover too weak. 14137 trivial. 0 not checked. [2022-11-23 13:44:07,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 1231 proven. 4923 refuted. 0 times theorem prover too weak. 28109 trivial. 0 not checked. [2022-11-23 13:44:14,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708524770] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:14,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [583290104] [2022-11-23 13:44:14,431 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:14,431 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:14,431 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:14,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:14,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 31] total 38 [2022-11-23 13:44:14,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916513805] [2022-11-23 13:44:14,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:14,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:44:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:44:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1262, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 13:44:14,439 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) [2022-11-23 13:44:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:16,490 INFO L93 Difference]: Finished difference Result 495 states and 814 transitions. [2022-11-23 13:44:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-23 13:44:16,491 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) Word has length 1072 [2022-11-23 13:44:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:16,496 INFO L225 Difference]: With dead ends: 495 [2022-11-23 13:44:16,496 INFO L226 Difference]: Without dead ends: 287 [2022-11-23 13:44:16,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2202 GetRequests, 2112 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=845, Invalid=5007, Unknown=0, NotChecked=0, Total=5852 [2022-11-23 13:44:16,500 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 350 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:16,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 419 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 13:44:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-23 13:44:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2022-11-23 13:44:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 189 states have (on average 1.0687830687830688) internal successors, (202), 182 states have internal predecessors, (202), 54 states have call successors, (54), 44 states have call predecessors, (54), 22 states have return successors, (145), 39 states have call predecessors, (145), 54 states have call successors, (145) [2022-11-23 13:44:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2022-11-23 13:44:16,526 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 1072 [2022-11-23 13:44:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:16,527 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2022-11-23 13:44:16,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) [2022-11-23 13:44:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2022-11-23 13:44:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2022-11-23 13:44:16,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:16,582 INFO L195 NwaCegarLoop]: trace histogram [91, 91, 84, 84, 72, 70, 45, 45, 45, 45, 45, 45, 45, 42, 42, 42, 42, 42, 42, 42, 30, 25, 19, 14, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:16,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:16,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:44:16,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605894, now seen corresponding path program 10 times [2022-11-23 13:44:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420841703] [2022-11-23 13:44:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 936 proven. 3401 refuted. 0 times theorem prover too weak. 38362 trivial. 0 not checked. [2022-11-23 13:44:19,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420841703] [2022-11-23 13:44:19,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420841703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137100294] [2022-11-23 13:44:19,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:44:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:19,151 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:19,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 13:44:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:19,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:44:19,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 963 proven. 3660 refuted. 0 times theorem prover too weak. 38076 trivial. 0 not checked. [2022-11-23 13:44:19,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 967 proven. 3708 refuted. 0 times theorem prover too weak. 38024 trivial. 0 not checked. [2022-11-23 13:44:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137100294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967322778] [2022-11-23 13:44:26,341 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:26,341 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:26,342 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:26,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:26,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2022-11-23 13:44:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847026252] [2022-11-23 13:44:26,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:26,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 13:44:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 13:44:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-11-23 13:44:26,347 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) [2022-11-23 13:44:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:26,904 INFO L93 Difference]: Finished difference Result 312 states and 524 transitions. [2022-11-23 13:44:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:44:26,905 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) Word has length 1195 [2022-11-23 13:44:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:26,911 INFO L225 Difference]: With dead ends: 312 [2022-11-23 13:44:26,912 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 13:44:26,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2421 GetRequests, 2374 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 13:44:26,915 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:26,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 367 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:44:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 13:44:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2022-11-23 13:44:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 185 states have (on average 1.0702702702702702) internal successors, (198), 178 states have internal predecessors, (198), 52 states have call successors, (52), 43 states have call predecessors, (52), 22 states have return successors, (103), 38 states have call predecessors, (103), 52 states have call successors, (103) [2022-11-23 13:44:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 353 transitions. [2022-11-23 13:44:26,938 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 353 transitions. Word has length 1195 [2022-11-23 13:44:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:26,940 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 353 transitions. [2022-11-23 13:44:26,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) [2022-11-23 13:44:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 353 transitions. [2022-11-23 13:44:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2022-11-23 13:44:26,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:26,958 INFO L195 NwaCegarLoop]: trace histogram [107, 107, 100, 100, 84, 83, 53, 53, 53, 53, 53, 53, 53, 50, 50, 50, 50, 50, 50, 50, 33, 31, 24, 16, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:26,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:27,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 13:44:27,167 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -536441660, now seen corresponding path program 11 times [2022-11-23 13:44:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:27,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458753680] [2022-11-23 13:44:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 907 proven. 3504 refuted. 0 times theorem prover too weak. 55374 trivial. 0 not checked. [2022-11-23 13:44:29,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:29,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458753680] [2022-11-23 13:44:29,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458753680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:29,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672738991] [2022-11-23 13:44:29,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:44:29,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:29,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:29,150 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:29,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 13:44:29,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2022-11-23 13:44:29,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:44:29,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:44:29,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 4403 proven. 340 refuted. 0 times theorem prover too weak. 55042 trivial. 0 not checked. [2022-11-23 13:44:29,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 4403 proven. 350 refuted. 0 times theorem prover too weak. 55032 trivial. 0 not checked. [2022-11-23 13:44:34,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672738991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:34,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1028507669] [2022-11-23 13:44:34,595 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:34,595 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:34,595 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:34,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:34,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 31 [2022-11-23 13:44:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447492986] [2022-11-23 13:44:34,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 13:44:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 13:44:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:44:34,602 INFO L87 Difference]: Start difference. First operand 260 states and 353 transitions. Second operand has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) [2022-11-23 13:44:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:36,175 INFO L93 Difference]: Finished difference Result 615 states and 879 transitions. [2022-11-23 13:44:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-23 13:44:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) Word has length 1412 [2022-11-23 13:44:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:36,181 INFO L225 Difference]: With dead ends: 615 [2022-11-23 13:44:36,181 INFO L226 Difference]: Without dead ends: 350 [2022-11-23 13:44:36,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2879 GetRequests, 2803 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=718, Invalid=3974, Unknown=0, NotChecked=0, Total=4692 [2022-11-23 13:44:36,185 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 221 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:36,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 273 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 13:44:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-23 13:44:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 298. [2022-11-23 13:44:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 213 states have (on average 1.0751173708920188) internal successors, (229), 205 states have internal predecessors, (229), 61 states have call successors, (61), 51 states have call predecessors, (61), 23 states have return successors, (109), 41 states have call predecessors, (109), 61 states have call successors, (109) [2022-11-23 13:44:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2022-11-23 13:44:36,212 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 1412 [2022-11-23 13:44:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:36,212 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2022-11-23 13:44:36,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) [2022-11-23 13:44:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2022-11-23 13:44:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1005 [2022-11-23 13:44:36,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:36,223 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 70, 70, 60, 59, 38, 38, 38, 38, 38, 38, 38, 35, 35, 35, 35, 35, 35, 35, 25, 21, 17, 11, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:36,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:36,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:36,430 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1658567862, now seen corresponding path program 12 times [2022-11-23 13:44:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:36,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370873112] [2022-11-23 13:44:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 990 proven. 2089 refuted. 0 times theorem prover too weak. 26958 trivial. 0 not checked. [2022-11-23 13:44:37,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:37,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370873112] [2022-11-23 13:44:37,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370873112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:37,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534376217] [2022-11-23 13:44:37,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:44:37,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:37,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:37,554 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:37,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 13:44:38,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:44:38,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:44:38,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 13:44:38,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 15170 proven. 926 refuted. 0 times theorem prover too weak. 13941 trivial. 0 not checked. [2022-11-23 13:44:38,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 1073 proven. 4103 refuted. 0 times theorem prover too weak. 24861 trivial. 0 not checked. [2022-11-23 13:44:44,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534376217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:44,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495092937] [2022-11-23 13:44:44,515 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:44,516 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:44,516 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:44,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:44,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 27] total 35 [2022-11-23 13:44:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331692687] [2022-11-23 13:44:44,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 13:44:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 13:44:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:44:44,521 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) [2022-11-23 13:44:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:46,407 INFO L93 Difference]: Finished difference Result 547 states and 766 transitions. [2022-11-23 13:44:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-23 13:44:46,407 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) Word has length 1004 [2022-11-23 13:44:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:46,410 INFO L225 Difference]: With dead ends: 547 [2022-11-23 13:44:46,411 INFO L226 Difference]: Without dead ends: 273 [2022-11-23 13:44:46,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2068 GetRequests, 1979 SyntacticMatches, 13 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=850, Invalid=5156, Unknown=0, NotChecked=0, Total=6006 [2022-11-23 13:44:46,415 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 265 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:46,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 461 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:44:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-23 13:44:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 235. [2022-11-23 13:44:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 166 states have (on average 1.0542168674698795) internal successors, (175), 160 states have internal predecessors, (175), 47 states have call successors, (47), 37 states have call predecessors, (47), 21 states have return successors, (74), 37 states have call predecessors, (74), 47 states have call successors, (74) [2022-11-23 13:44:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 296 transitions. [2022-11-23 13:44:46,442 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 296 transitions. Word has length 1004 [2022-11-23 13:44:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:46,443 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 296 transitions. [2022-11-23 13:44:46,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) [2022-11-23 13:44:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 296 transitions. [2022-11-23 13:44:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1468 [2022-11-23 13:44:46,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:46,462 INFO L195 NwaCegarLoop]: trace histogram [108, 108, 107, 107, 88, 86, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 35, 32, 21, 20, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:46,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-23 13:44:46,670 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 119759346, now seen corresponding path program 13 times [2022-11-23 13:44:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:46,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196959103] [2022-11-23 13:44:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1441 proven. 3358 refuted. 0 times theorem prover too weak. 59716 trivial. 0 not checked. [2022-11-23 13:44:48,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196959103] [2022-11-23 13:44:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196959103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170363009] [2022-11-23 13:44:48,762 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:44:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:48,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:48,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 13:44:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:49,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:44:49,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:44:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1633 proven. 4118 refuted. 0 times theorem prover too weak. 58764 trivial. 0 not checked. [2022-11-23 13:44:49,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:44:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1635 proven. 4168 refuted. 0 times theorem prover too weak. 58712 trivial. 0 not checked. [2022-11-23 13:44:56,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170363009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:44:56,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [611334714] [2022-11-23 13:44:56,931 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:44:56,931 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:44:56,932 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:44:56,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:44:56,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2022-11-23 13:44:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992813059] [2022-11-23 13:44:56,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:44:56,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 13:44:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:44:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 13:44:56,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:44:56,936 INFO L87 Difference]: Start difference. First operand 235 states and 296 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2022-11-23 13:44:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:44:57,409 INFO L93 Difference]: Finished difference Result 257 states and 331 transitions. [2022-11-23 13:44:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:44:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) Word has length 1467 [2022-11-23 13:44:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:44:57,414 INFO L225 Difference]: With dead ends: 257 [2022-11-23 13:44:57,415 INFO L226 Difference]: Without dead ends: 235 [2022-11-23 13:44:57,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2963 GetRequests, 2915 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 13:44:57,416 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:44:57,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 354 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:44:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-23 13:44:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-23 13:44:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 166 states have (on average 1.0542168674698795) internal successors, (175), 160 states have internal predecessors, (175), 47 states have call successors, (47), 37 states have call predecessors, (47), 21 states have return successors, (71), 37 states have call predecessors, (71), 47 states have call successors, (71) [2022-11-23 13:44:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2022-11-23 13:44:57,437 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 1467 [2022-11-23 13:44:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:44:57,438 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2022-11-23 13:44:57,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2022-11-23 13:44:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2022-11-23 13:44:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2022-11-23 13:44:57,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:44:57,457 INFO L195 NwaCegarLoop]: trace histogram [105, 105, 104, 104, 85, 84, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 33, 32, 20, 20, 1, 1, 1, 1, 1, 1] [2022-11-23 13:44:57,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 13:44:57,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:57,667 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:44:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:44:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1110263143, now seen corresponding path program 14 times [2022-11-23 13:44:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:44:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254304264] [2022-11-23 13:44:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:44:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:44:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:44:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 1409 proven. 2489 refuted. 0 times theorem prover too weak. 57030 trivial. 0 not checked. [2022-11-23 13:44:59,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:44:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254304264] [2022-11-23 13:44:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254304264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:44:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349162852] [2022-11-23 13:44:59,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:44:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:44:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:44:59,072 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:44:59,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 13:44:59,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-11-23 13:44:59,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:44:59,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 1813 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:44:59,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 3411 proven. 488 refuted. 0 times theorem prover too weak. 57029 trivial. 0 not checked. [2022-11-23 13:45:00,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 3411 proven. 513 refuted. 0 times theorem prover too weak. 57004 trivial. 0 not checked. [2022-11-23 13:45:04,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349162852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:04,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [25649231] [2022-11-23 13:45:04,739 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:45:04,739 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:45:04,739 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:45:04,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:04,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 29 [2022-11-23 13:45:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417322518] [2022-11-23 13:45:04,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:04,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 13:45:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 13:45:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:45:04,744 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) [2022-11-23 13:45:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:05,796 INFO L93 Difference]: Finished difference Result 483 states and 609 transitions. [2022-11-23 13:45:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-23 13:45:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) Word has length 1426 [2022-11-23 13:45:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:05,802 INFO L225 Difference]: With dead ends: 483 [2022-11-23 13:45:05,802 INFO L226 Difference]: Without dead ends: 267 [2022-11-23 13:45:05,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2897 GetRequests, 2832 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=2909, Unknown=0, NotChecked=0, Total=3422 [2022-11-23 13:45:05,805 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 174 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 330 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:45:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-23 13:45:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2022-11-23 13:45:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 156 states have (on average 1.0576923076923077) internal successors, (165), 151 states have internal predecessors, (165), 44 states have call successors, (44), 35 states have call predecessors, (44), 20 states have return successors, (57), 34 states have call predecessors, (57), 44 states have call successors, (57) [2022-11-23 13:45:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 266 transitions. [2022-11-23 13:45:05,826 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 266 transitions. Word has length 1426 [2022-11-23 13:45:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:05,827 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 266 transitions. [2022-11-23 13:45:05,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) [2022-11-23 13:45:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 266 transitions. [2022-11-23 13:45:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1563 [2022-11-23 13:45:05,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:05,848 INFO L195 NwaCegarLoop]: trace histogram [116, 116, 113, 113, 93, 92, 58, 58, 58, 58, 58, 58, 58, 56, 56, 56, 56, 56, 56, 56, 37, 34, 23, 21, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:05,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:06,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:06,057 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:45:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1183225277, now seen corresponding path program 15 times [2022-11-23 13:45:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:06,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934385234] [2022-11-23 13:45:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 1946 proven. 3179 refuted. 0 times theorem prover too weak. 68103 trivial. 0 not checked. [2022-11-23 13:45:08,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934385234] [2022-11-23 13:45:08,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934385234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953064208] [2022-11-23 13:45:08,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:45:08,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:08,087 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:08,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 13:45:08,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:45:08,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:45:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 13:45:08,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 37542 proven. 3730 refuted. 0 times theorem prover too weak. 31956 trivial. 0 not checked. [2022-11-23 13:45:09,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 2254 proven. 8122 refuted. 0 times theorem prover too weak. 62852 trivial. 0 not checked. [2022-11-23 13:45:19,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953064208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:19,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [985711219] [2022-11-23 13:45:19,189 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:45:19,189 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:45:19,190 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:45:19,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:19,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 35] total 46 [2022-11-23 13:45:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776464696] [2022-11-23 13:45:19,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:19,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 13:45:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:19,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 13:45:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2022-11-23 13:45:19,194 INFO L87 Difference]: Start difference. First operand 221 states and 266 transitions. Second operand has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) [2022-11-23 13:45:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:21,283 INFO L93 Difference]: Finished difference Result 453 states and 568 transitions. [2022-11-23 13:45:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-23 13:45:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) Word has length 1562 [2022-11-23 13:45:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:21,287 INFO L225 Difference]: With dead ends: 453 [2022-11-23 13:45:21,288 INFO L226 Difference]: Without dead ends: 254 [2022-11-23 13:45:21,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3188 GetRequests, 3082 SyntacticMatches, 17 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1112, Invalid=7078, Unknown=0, NotChecked=0, Total=8190 [2022-11-23 13:45:21,293 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 340 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:21,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 555 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 13:45:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-23 13:45:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2022-11-23 13:45:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 171 states have (on average 1.0584795321637428) internal successors, (181), 165 states have internal predecessors, (181), 48 states have call successors, (48), 40 states have call predecessors, (48), 20 states have return successors, (62), 34 states have call predecessors, (62), 48 states have call successors, (62) [2022-11-23 13:45:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2022-11-23 13:45:21,315 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 1562 [2022-11-23 13:45:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:21,316 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2022-11-23 13:45:21,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) [2022-11-23 13:45:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2022-11-23 13:45:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2022-11-23 13:45:21,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:21,333 INFO L195 NwaCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:21,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:21,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:21,548 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:45:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash -804575120, now seen corresponding path program 16 times [2022-11-23 13:45:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80239394] [2022-11-23 13:45:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2894 proven. 1625 refuted. 0 times theorem prover too weak. 52927 trivial. 0 not checked. [2022-11-23 13:45:23,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:45:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80239394] [2022-11-23 13:45:23,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80239394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:45:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746484341] [2022-11-23 13:45:23,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:45:23,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:23,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:45:23,185 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:45:23,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 13:45:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:45:24,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 3101 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:45:24,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:45:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 3413 proven. 2000 refuted. 0 times theorem prover too weak. 52033 trivial. 0 not checked. [2022-11-23 13:45:24,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:45:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 3413 proven. 2052 refuted. 0 times theorem prover too weak. 51981 trivial. 0 not checked. [2022-11-23 13:45:30,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746484341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:45:30,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [361911198] [2022-11-23 13:45:30,964 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:45:30,964 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:45:30,964 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:45:30,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:45:30,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2022-11-23 13:45:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832943986] [2022-11-23 13:45:30,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:45:30,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 13:45:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:45:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 13:45:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:45:30,969 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2022-11-23 13:45:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:45:31,410 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2022-11-23 13:45:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:45:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) Word has length 1385 [2022-11-23 13:45:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:45:31,413 INFO L225 Difference]: With dead ends: 250 [2022-11-23 13:45:31,413 INFO L226 Difference]: Without dead ends: 238 [2022-11-23 13:45:31,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2799 GetRequests, 2751 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 13:45:31,415 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 77 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:45:31,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 339 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:45:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-23 13:45:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2022-11-23 13:45:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 170 states have (on average 1.0588235294117647) internal successors, (180), 163 states have internal predecessors, (180), 46 states have call successors, (46), 40 states have call predecessors, (46), 20 states have return successors, (50), 33 states have call predecessors, (50), 46 states have call successors, (50) [2022-11-23 13:45:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 276 transitions. [2022-11-23 13:45:31,435 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 276 transitions. Word has length 1385 [2022-11-23 13:45:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:45:31,436 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 276 transitions. [2022-11-23 13:45:31,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2022-11-23 13:45:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 276 transitions. [2022-11-23 13:45:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2022-11-23 13:45:31,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:45:31,450 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:31,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 13:45:31,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:45:31,661 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:45:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:45:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 529873829, now seen corresponding path program 17 times [2022-11-23 13:45:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:45:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878803976] [2022-11-23 13:45:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:45:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:45:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:45:31,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:45:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:45:32,522 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:45:32,522 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:45:32,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 13:45:32,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 13:45:32,529 INFO L444 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:45:32,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:45:32,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:45:32 BoogieIcfgContainer [2022-11-23 13:45:32,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:45:32,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:45:32,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:45:32,733 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:45:32,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:21" (3/4) ... [2022-11-23 13:45:32,736 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 13:45:32,934 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 13:45:32,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:45:32,935 INFO L158 Benchmark]: Toolchain (without parser) took 132036.06ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 76.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,935 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:45:32,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.99ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 66.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.19ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 64.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,940 INFO L158 Benchmark]: Boogie Preprocessor took 16.55ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 63.8MB in the end (delta: 810.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,941 INFO L158 Benchmark]: RCFGBuilder took 448.70ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 63.8MB in the beginning and 129.0MB in the end (delta: -65.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,945 INFO L158 Benchmark]: TraceAbstraction took 131062.18ms. Allocated memory was 157.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 128.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 876.6MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,947 INFO L158 Benchmark]: Witness Printer took 201.11ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 13:45:32,949 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.21ms. Allocated memory is still 117.4MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.99ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 66.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.19ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 64.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.55ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 63.8MB in the end (delta: 810.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.70ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 63.8MB in the beginning and 129.0MB in the end (delta: -65.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 131062.18ms. Allocated memory was 157.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 128.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 876.6MB. Max. memory is 16.1GB. * Witness Printer took 201.11ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [unknown-#in~n-unknown=10] [L10] COND FALSE !(n < 1) VAL [n=10, unknown-#in~n-unknown=10] [L12] COND FALSE !(n == 1) VAL [n=10, unknown-#in~n-unknown=10] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=9] [L20] COND FALSE !(n < 1) VAL [n=9, unknown-#in~n-unknown=9] [L22] COND FALSE !(n == 1) VAL [n=9, unknown-#in~n-unknown=9] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=8] [L10] COND FALSE !(n < 1) VAL [n=8, unknown-#in~n-unknown=8] [L12] COND FALSE !(n == 1) VAL [n=8, unknown-#in~n-unknown=8] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=7] [L20] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L22] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=6] [L10] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L12] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=5] [L20] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L22] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=3, n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=3, fibo1(n-2)=2, n=5, unknown-#in~n-unknown=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=5, n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=5, fibo2(n-2)=3, n=6, unknown-#in~n-unknown=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=8, n=7, unknown-#in~n-unknown=7] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=8, fibo1(n-2)=5, n=7, unknown-#in~n-unknown=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=13, n=8, unknown-#in~n-unknown=8] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=6] [L20] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L22] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=5, n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=5, fibo1(n-2)=3, n=6, unknown-#in~n-unknown=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=13, fibo2(n-2)=8, n=8, unknown-#in~n-unknown=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=21, n=9, unknown-#in~n-unknown=9] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=7] [L10] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L12] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=6] [L20] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L22] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=5, n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=5, fibo1(n-2)=3, n=6, unknown-#in~n-unknown=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=8, n=7, unknown-#in~n-unknown=7] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=5] [L20] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L22] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=3, n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=3, fibo1(n-2)=2, n=5, unknown-#in~n-unknown=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=8, fibo2(n-2)=5, n=7, unknown-#in~n-unknown=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=21, fibo1(n-2)=13, n=9, unknown-#in~n-unknown=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=34, n=10, unknown-#in~n-unknown=10] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=8] [L20] COND FALSE !(n < 1) VAL [n=8, unknown-#in~n-unknown=8] [L22] COND FALSE !(n == 1) VAL [n=8, unknown-#in~n-unknown=8] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=7] [L10] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L12] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=6] [L20] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L22] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=5, n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=5, fibo1(n-2)=3, n=6, unknown-#in~n-unknown=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=8, n=7, unknown-#in~n-unknown=7] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=5] [L20] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L22] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=3, n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=3, fibo1(n-2)=2, n=5, unknown-#in~n-unknown=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=8, fibo2(n-2)=5, n=7, unknown-#in~n-unknown=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=13, n=8, unknown-#in~n-unknown=8] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=6] [L10] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L12] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=5] [L20] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L22] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=3, n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=3, fibo1(n-2)=2, n=5, unknown-#in~n-unknown=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=5, n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=5, fibo2(n-2)=3, n=6, unknown-#in~n-unknown=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=13, fibo1(n-2)=8, n=8, unknown-#in~n-unknown=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=34, fibo2(n-2)=21, n=10, unknown-#in~n-unknown=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.8s, OverallIterations: 25, TraceHistogramMax: 116, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.3s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2912 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2819 mSDsluCounter, 6038 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5267 mSDsCounter, 3481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16584 IncrementalHoareTripleChecker+Invalid, 20065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3481 mSolverCounterUnsat, 771 mSDtfsCounter, 16584 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28880 GetRequests, 27795 SyntacticMatches, 163 SemanticMatches, 922 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12766 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=19, InterpolantAutomatonStates: 607, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 390 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 93.8s InterpolantComputationTime, 29339 NumberOfCodeBlocks, 25739 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 42119 ConstructedInterpolants, 0 QuantifiedInterpolants, 50643 SizeOfPredicates, 150 NumberOfNonLiveVariables, 23174 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 68 InterpolantComputations, 2 PerfectInterpolantSequences, 1340419/1421754 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: OVERALL_TIME: 0.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 13:45:33,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90b425c7-5a41-4327-8aac-96f2df006a76/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE