./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_25-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI --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 7ad88fb205242ec446a08384ae9c868bf7c17f001b4ed74a5de911f546d9b565 --- 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-5e519f3 [2022-11-03 01:41:16,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:41:16,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:41:16,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:41:16,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:41:16,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:41:16,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:41:16,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:41:16,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:41:16,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:41:16,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:41:16,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:41:16,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:41:16,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:41:16,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:41:16,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:41:16,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:41:16,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:41:16,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:41:16,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:41:16,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:41:16,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:41:16,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:41:16,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:41:16,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:41:16,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:41:16,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:41:16,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:41:16,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:41:16,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:41:16,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:41:16,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:41:16,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:41:16,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:41:16,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:41:16,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:41:16,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:41:16,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:41:16,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:41:16,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:41:16,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:41:16,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:41:16,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:41:16,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:41:16,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:41:16,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:41:16,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:41:16,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:41:16,940 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:41:16,941 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:41:16,941 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:41:16,941 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:41:16,941 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:41:16,941 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:41:16,942 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:41:16,942 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:41:16,942 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:41:16,942 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:41:16,943 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:41:16,943 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:41:16,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:41:16,944 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:41:16,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:41:16,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:41:16,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:41:16,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:41:16,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:41:16,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:41:16,945 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:41:16,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:41:16,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:41:16,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:41:16,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:41:16,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:41:16,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:16,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:41:16,947 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:41:16,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:41:16,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:41:16,948 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:41:16,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:41:16,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:41:16,955 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:41:16,955 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_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/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_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI 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 -> 7ad88fb205242ec446a08384ae9c868bf7c17f001b4ed74a5de911f546d9b565 [2022-11-03 01:41:17,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:41:17,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:41:17,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:41:17,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:41:17,355 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:41:17,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/recursive-simple/fibo_25-1.c [2022-11-03 01:41:17,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/data/9fe7529bf/7ea2b2aa20ef4b17a37bd21e881f5f0a/FLAG4567779fd [2022-11-03 01:41:17,986 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:41:17,987 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/sv-benchmarks/c/recursive-simple/fibo_25-1.c [2022-11-03 01:41:17,994 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/data/9fe7529bf/7ea2b2aa20ef4b17a37bd21e881f5f0a/FLAG4567779fd [2022-11-03 01:41:18,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/data/9fe7529bf/7ea2b2aa20ef4b17a37bd21e881f5f0a [2022-11-03 01:41:18,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:41:18,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:41:18,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:18,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:41:18,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:41:18,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60249376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18, skipping insertion in model container [2022-11-03 01:41:18,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:41:18,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:41:18,693 WARN L230 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_29bc7a58-64e3-43a0-a8d3-53d611e99803/sv-benchmarks/c/recursive-simple/fibo_25-1.c[746,759] [2022-11-03 01:41:18,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:18,706 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:41:18,722 WARN L230 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_29bc7a58-64e3-43a0-a8d3-53d611e99803/sv-benchmarks/c/recursive-simple/fibo_25-1.c[746,759] [2022-11-03 01:41:18,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:18,739 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:41:18,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18 WrapperNode [2022-11-03 01:41:18,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:18,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:18,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:41:18,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:41:18,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,778 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-03 01:41:18,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:18,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:41:18,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:41:18,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:41:18,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,805 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:41:18,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:41:18,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:41:18,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:41:18,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (1/1) ... [2022-11-03 01:41:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:18,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:18,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:41:18,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:41:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:41:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:41:18,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:41:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:41:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-11-03 01:41:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-11-03 01:41:18,988 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:41:18,990 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:41:19,143 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:41:19,190 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:41:19,190 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:41:19,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:19 BoogieIcfgContainer [2022-11-03 01:41:19,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:41:19,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:41:19,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:41:19,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:41:19,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:41:18" (1/3) ... [2022-11-03 01:41:19,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0d985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:19, skipping insertion in model container [2022-11-03 01:41:19,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:18" (2/3) ... [2022-11-03 01:41:19,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0d985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:19, skipping insertion in model container [2022-11-03 01:41:19,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:19" (3/3) ... [2022-11-03 01:41:19,215 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_25-1.c [2022-11-03 01:41:19,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:41:19,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:41:19,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:41:19,362 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;@79bb0078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:41:19,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:41:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:41:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:41:19,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:19,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:19,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1688587911, now seen corresponding path program 1 times [2022-11-03 01:41:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:19,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353583685] [2022-11-03 01:41:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:19,740 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-03 01:41:19,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353583685] [2022-11-03 01:41:19,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353583685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:19,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:19,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:41:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917660854] [2022-11-03 01:41:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:19,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:41:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:41:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:41:19,798 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.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-03 01:41:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:19,896 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-11-03 01:41:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:41:19,899 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-03 01:41:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:19,908 INFO L225 Difference]: With dead ends: 27 [2022-11-03 01:41:19,908 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 01:41:19,914 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-03 01:41:19,923 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 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-03 01:41:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 01:41:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 01:41:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:41:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 01:41:19,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2022-11-03 01:41:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:19,978 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 01:41:19,978 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-03 01:41:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 01:41:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:41:19,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:19,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:19,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:41:19,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1521360425, now seen corresponding path program 1 times [2022-11-03 01:41:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:19,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973313829] [2022-11-03 01:41:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:20,052 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-03 01:41:20,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973313829] [2022-11-03 01:41:20,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973313829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:20,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:20,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:41:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359701033] [2022-11-03 01:41:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:20,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:41:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:41:20,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:41:20,057 INFO L87 Difference]: Start difference. First operand 17 states and 21 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-03 01:41:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:20,101 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-11-03 01:41:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:41:20,102 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-03 01:41:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:20,103 INFO L225 Difference]: With dead ends: 23 [2022-11-03 01:41:20,104 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 01:41:20,104 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-03 01:41:20,106 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-03 01:41:20,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:41:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 01:41:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-03 01:41:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:41:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 01:41:20,115 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-11-03 01:41:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:20,116 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 01:41:20,116 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-03 01:41:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 01:41:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:41:20,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:20,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:20,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:41:20,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1124411740, now seen corresponding path program 1 times [2022-11-03 01:41:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89522669] [2022-11-03 01:41:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:41:20,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:20,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89522669] [2022-11-03 01:41:20,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89522669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067341647] [2022-11-03 01:41:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:20,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:20,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:20,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:20,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:41:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:20,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:41:20,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:41:20,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:41:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067341647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691103693] [2022-11-03 01:41:20,984 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:20,984 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:20,993 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-03 01:41:20,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:20,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-11-03 01:41:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547125763] [2022-11-03 01:41:20,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:20,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:41:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:41:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:41:20,997 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:41:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:21,111 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-11-03 01:41:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:41:21,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2022-11-03 01:41:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:21,113 INFO L225 Difference]: With dead ends: 34 [2022-11-03 01:41:21,113 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 01:41:21,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:41:21,115 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:21,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 01:41:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 01:41:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:41:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-03 01:41:21,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2022-11-03 01:41:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:21,123 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-03 01:41:21,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:41:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-03 01:41:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:41:21,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:21,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:21,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:41:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:21,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 992661418, now seen corresponding path program 1 times [2022-11-03 01:41:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082421067] [2022-11-03 01:41:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 01:41:21,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:21,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082421067] [2022-11-03 01:41:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082421067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:21,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669689198] [2022-11-03 01:41:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:21,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:21,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:41:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:21,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:41:21,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 01:41:21,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:41:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669689198] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1517982022] [2022-11-03 01:41:21,758 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:21,758 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:21,759 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-03 01:41:21,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:21,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2022-11-03 01:41:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033362431] [2022-11-03 01:41:21,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:21,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:41:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:21,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:41:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:41:21,763 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:41:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:21,837 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-11-03 01:41:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:41:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2022-11-03 01:41:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:21,839 INFO L225 Difference]: With dead ends: 28 [2022-11-03 01:41:21,840 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 01:41:21,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:41:21,841 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:21,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:41:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 01:41:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 01:41:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 01:41:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-03 01:41:21,849 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2022-11-03 01:41:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:21,850 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-03 01:41:21,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:41:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-03 01:41:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:41:21,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:21,852 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:21,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:22,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:22,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1950959585, now seen corresponding path program 2 times [2022-11-03 01:41:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:22,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880291235] [2022-11-03 01:41:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:41:22,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:22,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880291235] [2022-11-03 01:41:22,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880291235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:22,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926896411] [2022-11-03 01:41:22,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:22,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:22,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:41:22,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:41:22,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:22,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:41:22,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:41:22,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:41:22,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926896411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:22,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106161507] [2022-11-03 01:41:22,642 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:22,642 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:22,643 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-03 01:41:22,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:22,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2022-11-03 01:41:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138515891] [2022-11-03 01:41:22,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:22,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:41:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:41:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:41:22,647 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-03 01:41:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:22,928 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-11-03 01:41:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:41:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 36 [2022-11-03 01:41:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:22,931 INFO L225 Difference]: With dead ends: 55 [2022-11-03 01:41:22,932 INFO L226 Difference]: Without dead ends: 33 [2022-11-03 01:41:22,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:41:22,934 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:22,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 58 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-03 01:41:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-11-03 01:41:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-03 01:41:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-03 01:41:22,944 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2022-11-03 01:41:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:22,945 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-03 01:41:22,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-03 01:41:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-03 01:41:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 01:41:22,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:22,947 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:22,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:23,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:23,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1865467761, now seen corresponding path program 3 times [2022-11-03 01:41:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:23,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683295419] [2022-11-03 01:41:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:41:23,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:23,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683295419] [2022-11-03 01:41:23,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683295419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269277131] [2022-11-03 01:41:23,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:41:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:23,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:23,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:23,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:41:23,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:41:23,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:23,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:41:23,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:41:23,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:41:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269277131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:23,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2099686243] [2022-11-03 01:41:23,887 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:23,888 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:23,888 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-03 01:41:23,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:23,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2022-11-03 01:41:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101100647] [2022-11-03 01:41:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:23,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:41:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:23,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:41:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:41:23,890 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 01:41:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:24,004 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-11-03 01:41:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:41:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2022-11-03 01:41:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:24,007 INFO L225 Difference]: With dead ends: 36 [2022-11-03 01:41:24,007 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 01:41:24,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:41:24,008 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:24,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 35 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 01:41:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-03 01:41:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-03 01:41:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-11-03 01:41:24,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2022-11-03 01:41:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:24,017 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2022-11-03 01:41:24,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 01:41:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2022-11-03 01:41:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-03 01:41:24,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:24,020 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:24,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 01:41:24,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1351422375, now seen corresponding path program 4 times [2022-11-03 01:41:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609537625] [2022-11-03 01:41:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-03 01:41:24,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609537625] [2022-11-03 01:41:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609537625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933578023] [2022-11-03 01:41:24,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:41:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:24,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:24,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:41:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:24,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:41:24,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-03 01:41:24,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-03 01:41:25,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933578023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567378741] [2022-11-03 01:41:25,304 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:25,304 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:25,305 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-03 01:41:25,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:25,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2022-11-03 01:41:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704722900] [2022-11-03 01:41:25,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:25,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:41:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:25,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:41:25,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:41:25,315 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 01:41:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:25,479 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2022-11-03 01:41:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:41:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 64 [2022-11-03 01:41:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:25,490 INFO L225 Difference]: With dead ends: 41 [2022-11-03 01:41:25,490 INFO L226 Difference]: Without dead ends: 37 [2022-11-03 01:41:25,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:41:25,496 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:25,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 41 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-03 01:41:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-03 01:41:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2022-11-03 01:41:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2022-11-03 01:41:25,525 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2022-11-03 01:41:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:25,526 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2022-11-03 01:41:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 01:41:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2022-11-03 01:41:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-11-03 01:41:25,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:25,542 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:25,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:25,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:41:25,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1437906103, now seen corresponding path program 5 times [2022-11-03 01:41:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818180383] [2022-11-03 01:41:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2022-11-03 01:41:26,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:26,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818180383] [2022-11-03 01:41:26,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818180383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:26,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237697413] [2022-11-03 01:41:26,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:26,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:26,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:41:26,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-03 01:41:26,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:26,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:41:26,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2022-11-03 01:41:26,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2022-11-03 01:41:27,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237697413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:27,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1574437711] [2022-11-03 01:41:27,428 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:27,428 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:27,429 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-03 01:41:27,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:27,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-11-03 01:41:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38426952] [2022-11-03 01:41:27,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:27,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:41:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:41:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:41:27,436 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-03 01:41:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:27,901 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2022-11-03 01:41:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:41:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 202 [2022-11-03 01:41:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:27,904 INFO L225 Difference]: With dead ends: 94 [2022-11-03 01:41:27,904 INFO L226 Difference]: Without dead ends: 58 [2022-11-03 01:41:27,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 397 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:41:27,906 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 115 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:27,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 73 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:41:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-03 01:41:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-03 01:41:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-03 01:41:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2022-11-03 01:41:27,931 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 202 [2022-11-03 01:41:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:27,936 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-11-03 01:41:27,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-03 01:41:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2022-11-03 01:41:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-03 01:41:27,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:27,940 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:27,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:28,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1858393177, now seen corresponding path program 6 times [2022-11-03 01:41:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:28,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86566105] [2022-11-03 01:41:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-03 01:41:28,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86566105] [2022-11-03 01:41:28,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86566105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311771425] [2022-11-03 01:41:28,549 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:41:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:28,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:28,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:28,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:41:28,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:41:28,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:28,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:41:28,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-03 01:41:28,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2022-11-03 01:41:30,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311771425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:30,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [528504665] [2022-11-03 01:41:30,330 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:30,330 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:30,330 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-03 01:41:30,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:30,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2022-11-03 01:41:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666641964] [2022-11-03 01:41:30,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:41:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:41:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:41:30,333 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-03 01:41:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:30,559 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2022-11-03 01:41:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:41:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 173 [2022-11-03 01:41:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:30,565 INFO L225 Difference]: With dead ends: 67 [2022-11-03 01:41:30,565 INFO L226 Difference]: Without dead ends: 63 [2022-11-03 01:41:30,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 338 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:41:30,567 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:30,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 63 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-03 01:41:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-03 01:41:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-03 01:41:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2022-11-03 01:41:30,577 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2022-11-03 01:41:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:30,577 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2022-11-03 01:41:30,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-03 01:41:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2022-11-03 01:41:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-11-03 01:41:30,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:30,582 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:30,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:30,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:30,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1234663993, now seen corresponding path program 7 times [2022-11-03 01:41:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829648562] [2022-11-03 01:41:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 01:41:31,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829648562] [2022-11-03 01:41:31,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829648562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467718036] [2022-11-03 01:41:31,455 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:41:31,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:31,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:31,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:41:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:31,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:41:31,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 01:41:31,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2022-11-03 01:41:34,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467718036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1124896371] [2022-11-03 01:41:34,165 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:34,165 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:34,165 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-03 01:41:34,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:34,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2022-11-03 01:41:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326673142] [2022-11-03 01:41:34,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:34,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:41:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:41:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:41:34,174 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-03 01:41:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:34,398 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2022-11-03 01:41:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:41:34,399 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 282 [2022-11-03 01:41:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:34,401 INFO L225 Difference]: With dead ends: 72 [2022-11-03 01:41:34,401 INFO L226 Difference]: Without dead ends: 68 [2022-11-03 01:41:34,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 555 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2022-11-03 01:41:34,402 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:34,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-03 01:41:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-03 01:41:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) [2022-11-03 01:41:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2022-11-03 01:41:34,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 282 [2022-11-03 01:41:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:34,430 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2022-11-03 01:41:34,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-03 01:41:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2022-11-03 01:41:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-11-03 01:41:34,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:34,450 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 71, 44, 44, 44, 44, 44, 44, 44, 27, 18, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:34,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:34,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:41:34,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:34,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1790718179, now seen corresponding path program 8 times [2022-11-03 01:41:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:34,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124923979] [2022-11-03 01:41:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 493 proven. 3110 refuted. 0 times theorem prover too weak. 18330 trivial. 0 not checked. [2022-11-03 01:41:36,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:36,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124923979] [2022-11-03 01:41:36,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124923979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:36,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557831127] [2022-11-03 01:41:36,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:36,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:36,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:36,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:41:36,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-03 01:41:36,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:36,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:41:36,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 71 refuted. 0 times theorem prover too weak. 19191 trivial. 0 not checked. [2022-11-03 01:41:36,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 77 refuted. 0 times theorem prover too weak. 19185 trivial. 0 not checked. [2022-11-03 01:41:38,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557831127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867329092] [2022-11-03 01:41:38,762 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:38,762 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:38,763 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-03 01:41:38,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 23 [2022-11-03 01:41:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472745006] [2022-11-03 01:41:38,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:38,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:41:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:41:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:41:38,768 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-03 01:41:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:39,681 INFO L93 Difference]: Finished difference Result 169 states and 326 transitions. [2022-11-03 01:41:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-03 01:41:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) Word has length 608 [2022-11-03 01:41:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:39,684 INFO L225 Difference]: With dead ends: 169 [2022-11-03 01:41:39,684 INFO L226 Difference]: Without dead ends: 107 [2022-11-03 01:41:39,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1206 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2022-11-03 01:41:39,687 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 274 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:39,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 96 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:41:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-03 01:41:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-11-03 01:41:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 66 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 10 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2022-11-03 01:41:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2022-11-03 01:41:39,704 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 608 [2022-11-03 01:41:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:39,704 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2022-11-03 01:41:39,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-03 01:41:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2022-11-03 01:41:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2022-11-03 01:41:39,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:39,738 INFO L195 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:39,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:41:39,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1534963906, now seen corresponding path program 9 times [2022-11-03 01:41:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:39,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140896358] [2022-11-03 01:41:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2022-11-03 01:41:42,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140896358] [2022-11-03 01:41:42,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140896358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:42,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532227068] [2022-11-03 01:41:42,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:41:42,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:42,152 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:42,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:41:42,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:41:42,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:42,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 01:41:42,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7472 refuted. 0 times theorem prover too weak. 39653 trivial. 0 not checked. [2022-11-03 01:41:42,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7619 refuted. 0 times theorem prover too weak. 39506 trivial. 0 not checked. [2022-11-03 01:41:51,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532227068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:51,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [792785303] [2022-11-03 01:41:51,115 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:41:51,115 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:51,115 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-03 01:41:51,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:51,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 35] total 39 [2022-11-03 01:41:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485473961] [2022-11-03 01:41:51,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:51,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 01:41:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 01:41:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:41:51,123 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2022-11-03 01:41:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:52,925 INFO L93 Difference]: Finished difference Result 245 states and 492 transitions. [2022-11-03 01:41:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 01:41:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) Word has length 922 [2022-11-03 01:41:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:52,929 INFO L225 Difference]: With dead ends: 245 [2022-11-03 01:41:52,930 INFO L226 Difference]: Without dead ends: 153 [2022-11-03 01:41:52,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1899 GetRequests, 1809 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1293, Invalid=4257, Unknown=0, NotChecked=0, Total=5550 [2022-11-03 01:41:52,933 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 721 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1509 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:52,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 207 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1509 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 01:41:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-03 01:41:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2022-11-03 01:41:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 93 states have internal predecessors, (97), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (75), 19 states have call predecessors, (75), 27 states have call successors, (75) [2022-11-03 01:41:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2022-11-03 01:41:52,951 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2022-11-03 01:41:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:52,952 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2022-11-03 01:41:52,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2022-11-03 01:41:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2022-11-03 01:41:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2022-11-03 01:41:52,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:52,968 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:53,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:53,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:53,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1152068023, now seen corresponding path program 10 times [2022-11-03 01:41:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611199612] [2022-11-03 01:41:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 1164 proven. 8218 refuted. 0 times theorem prover too weak. 78387 trivial. 0 not checked. [2022-11-03 01:41:56,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:56,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611199612] [2022-11-03 01:41:56,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611199612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:56,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040288155] [2022-11-03 01:41:56,939 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:41:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:56,941 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:56,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:41:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:57,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 01:41:57,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 1164 proven. 8218 refuted. 0 times theorem prover too weak. 78387 trivial. 0 not checked. [2022-11-03 01:41:57,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 1164 proven. 8344 refuted. 0 times theorem prover too weak. 78261 trivial. 0 not checked. [2022-11-03 01:42:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040288155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296590181] [2022-11-03 01:42:04,606 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:42:04,607 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:42:04,607 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-03 01:42:04,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:42:04,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2022-11-03 01:42:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975276411] [2022-11-03 01:42:04,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:04,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 01:42:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:04,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 01:42:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:42:04,613 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 25 states have internal predecessors, (75), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2022-11-03 01:42:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:04,892 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-11-03 01:42:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:42:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 25 states have internal predecessors, (75), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) Word has length 1208 [2022-11-03 01:42:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:04,898 INFO L225 Difference]: With dead ends: 143 [2022-11-03 01:42:04,898 INFO L226 Difference]: Without dead ends: 139 [2022-11-03 01:42:04,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2447 GetRequests, 2404 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 01:42:04,900 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 130 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:04,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 81 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:42:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-03 01:42:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-03 01:42:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 96 states have internal predecessors, (100), 28 states have call successors, (28), 21 states have call predecessors, (28), 12 states have return successors, (87), 21 states have call predecessors, (87), 28 states have call successors, (87) [2022-11-03 01:42:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 215 transitions. [2022-11-03 01:42:04,917 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 215 transitions. Word has length 1208 [2022-11-03 01:42:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:04,918 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 215 transitions. [2022-11-03 01:42:04,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 25 states have internal predecessors, (75), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2022-11-03 01:42:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 215 transitions. [2022-11-03 01:42:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2421 [2022-11-03 01:42:04,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:04,990 INFO L195 NwaCegarLoop]: trace histogram [355, 355, 287, 177, 177, 177, 177, 177, 177, 177, 110, 68, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:05,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:05,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:05,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 753033058, now seen corresponding path program 11 times [2022-11-03 01:42:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:05,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803510535] [2022-11-03 01:42:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 354685 backedges. 2268 proven. 19045 refuted. 0 times theorem prover too weak. 333372 trivial. 0 not checked. [2022-11-03 01:42:14,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803510535] [2022-11-03 01:42:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803510535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:42:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217696818] [2022-11-03 01:42:14,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:42:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:14,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:14,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:42:15,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2022-11-03 01:42:15,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:42:15,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 01:42:15,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 354685 backedges. 2268 proven. 19045 refuted. 0 times theorem prover too weak. 333372 trivial. 0 not checked. [2022-11-03 01:42:15,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 354685 backedges. 2268 proven. 19200 refuted. 0 times theorem prover too weak. 333217 trivial. 0 not checked. [2022-11-03 01:42:26,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217696818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:26,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547011741] [2022-11-03 01:42:26,288 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:42:26,288 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:42:26,288 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-03 01:42:26,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:42:26,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2022-11-03 01:42:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499627156] [2022-11-03 01:42:26,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 01:42:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 01:42:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2022-11-03 01:42:26,296 INFO L87 Difference]: Start difference. First operand 139 states and 215 transitions. Second operand has 27 states, 25 states have (on average 3.24) internal successors, (81), 27 states have internal predecessors, (81), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2022-11-03 01:42:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:26,697 INFO L93 Difference]: Finished difference Result 148 states and 239 transitions. [2022-11-03 01:42:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:42:26,698 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.24) internal successors, (81), 27 states have internal predecessors, (81), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) Word has length 2420 [2022-11-03 01:42:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:26,705 INFO L225 Difference]: With dead ends: 148 [2022-11-03 01:42:26,705 INFO L226 Difference]: Without dead ends: 144 [2022-11-03 01:42:26,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4874 GetRequests, 4827 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 01:42:26,707 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 280 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:26,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 93 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:42:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-03 01:42:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-03 01:42:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 99 states have internal predecessors, (103), 29 states have call successors, (29), 21 states have call predecessors, (29), 13 states have return successors, (101), 23 states have call predecessors, (101), 29 states have call successors, (101) [2022-11-03 01:42:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 233 transitions. [2022-11-03 01:42:26,723 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 233 transitions. Word has length 2420 [2022-11-03 01:42:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:26,725 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 233 transitions. [2022-11-03 01:42:26,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.24) internal successors, (81), 27 states have internal predecessors, (81), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2022-11-03 01:42:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 233 transitions. [2022-11-03 01:42:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5063 [2022-11-03 01:42:27,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:27,057 INFO L195 NwaCegarLoop]: trace histogram [743, 743, 601, 371, 371, 371, 371, 371, 371, 371, 230, 142, 1, 1, 1, 1, 1, 1] [2022-11-03 01:42:27,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:27,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:42:27,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash -755122450, now seen corresponding path program 12 times [2022-11-03 01:42:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:27,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015986558] [2022-11-03 01:42:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1557452 backedges. 4536 proven. 44985 refuted. 0 times theorem prover too weak. 1507931 trivial. 0 not checked. [2022-11-03 01:42:58,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:58,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015986558] [2022-11-03 01:42:58,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015986558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:42:58,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627845080] [2022-11-03 01:42:58,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:42:58,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:58,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:58,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:42:59,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:42:59,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:42:59,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 9008 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 01:43:00,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1557452 backedges. 656147 proven. 14199 refuted. 0 times theorem prover too weak. 887106 trivial. 0 not checked. [2022-11-03 01:43:00,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1557452 backedges. 10504 proven. 70456 refuted. 0 times theorem prover too weak. 1476492 trivial. 0 not checked. [2022-11-03 01:43:23,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627845080] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:23,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889542749] [2022-11-03 01:43:23,445 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:43:23,445 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:23,445 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-03 01:43:23,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:23,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 39] total 45 [2022-11-03 01:43:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038072780] [2022-11-03 01:43:23,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:23,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-03 01:43:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:23,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-03 01:43:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1683, Unknown=0, NotChecked=0, Total=1980 [2022-11-03 01:43:23,458 INFO L87 Difference]: Start difference. First operand 144 states and 233 transitions. Second operand has 45 states, 44 states have (on average 3.25) internal successors, (143), 45 states have internal predecessors, (143), 41 states have call successors, (45), 2 states have call predecessors, (45), 23 states have return successors, (64), 22 states have call predecessors, (64), 41 states have call successors, (64) [2022-11-03 01:43:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:26,513 INFO L93 Difference]: Finished difference Result 372 states and 829 transitions. [2022-11-03 01:43:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-03 01:43:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.25) internal successors, (143), 45 states have internal predecessors, (143), 41 states have call successors, (45), 2 states have call predecessors, (45), 23 states have return successors, (64), 22 states have call predecessors, (64), 41 states have call successors, (64) Word has length 5062 [2022-11-03 01:43:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:26,520 INFO L225 Difference]: With dead ends: 372 [2022-11-03 01:43:26,520 INFO L226 Difference]: Without dead ends: 238 [2022-11-03 01:43:26,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10220 GetRequests, 10087 SyntacticMatches, 19 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3623 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2867, Invalid=10473, Unknown=0, NotChecked=0, Total=13340 [2022-11-03 01:43:26,529 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 936 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 2357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2357 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:26,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 231 Invalid, 3473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2357 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 01:43:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-03 01:43:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 215. [2022-11-03 01:43:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 151 states have internal predecessors, (159), 45 states have call successors, (45), 38 states have call predecessors, (45), 14 states have return successors, (153), 25 states have call predecessors, (153), 45 states have call successors, (153) [2022-11-03 01:43:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 357 transitions. [2022-11-03 01:43:26,562 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 357 transitions. Word has length 5062 [2022-11-03 01:43:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:26,565 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 357 transitions. [2022-11-03 01:43:26,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.25) internal successors, (143), 45 states have internal predecessors, (143), 41 states have call successors, (45), 2 states have call predecessors, (45), 23 states have return successors, (64), 22 states have call predecessors, (64), 41 states have call successors, (64) [2022-11-03 01:43:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 357 transitions. [2022-11-03 01:43:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5131 [2022-11-03 01:43:26,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:26,830 INFO L195 NwaCegarLoop]: trace histogram [753, 753, 609, 376, 376, 376, 376, 376, 376, 376, 233, 144, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:26,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:27,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:27,031 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1620267767, now seen corresponding path program 13 times [2022-11-03 01:43:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265000137] [2022-11-03 01:43:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1599648 backedges. 5686 proven. 48748 refuted. 0 times theorem prover too weak. 1545214 trivial. 0 not checked. [2022-11-03 01:44:01,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:01,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265000137] [2022-11-03 01:44:01,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265000137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:01,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043458762] [2022-11-03 01:44:01,284 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:44:01,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:01,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:01,285 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:01,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:44:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:03,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 11416 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 01:44:03,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1599648 backedges. 5686 proven. 48748 refuted. 0 times theorem prover too weak. 1545214 trivial. 0 not checked. [2022-11-03 01:44:03,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1599648 backedges. 5686 proven. 48970 refuted. 0 times theorem prover too weak. 1544992 trivial. 0 not checked. [2022-11-03 01:44:24,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043458762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:24,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [192384450] [2022-11-03 01:44:24,614 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:44:24,615 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:44:24,615 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-03 01:44:24,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:24,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2022-11-03 01:44:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897097237] [2022-11-03 01:44:24,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:24,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:44:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:44:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:44:24,626 INFO L87 Difference]: Start difference. First operand 215 states and 357 transitions. Second operand has 31 states, 29 states have (on average 3.206896551724138) internal successors, (93), 31 states have internal predecessors, (93), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (40), 14 states have call predecessors, (40), 28 states have call successors, (40) [2022-11-03 01:44:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:25,070 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2022-11-03 01:44:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:44:25,072 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.206896551724138) internal successors, (93), 31 states have internal predecessors, (93), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (40), 14 states have call predecessors, (40), 28 states have call successors, (40) Word has length 5130 [2022-11-03 01:44:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:25,081 INFO L225 Difference]: With dead ends: 224 [2022-11-03 01:44:25,081 INFO L226 Difference]: Without dead ends: 220 [2022-11-03 01:44:25,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10300 GetRequests, 10245 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 01:44:25,082 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 332 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:25,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 98 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:44:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-03 01:44:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-03 01:44:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 158 states have (on average 1.0253164556962024) internal successors, (162), 154 states have internal predecessors, (162), 46 states have call successors, (46), 38 states have call predecessors, (46), 15 states have return successors, (168), 27 states have call predecessors, (168), 46 states have call successors, (168) [2022-11-03 01:44:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 376 transitions. [2022-11-03 01:44:25,114 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 376 transitions. Word has length 5130 [2022-11-03 01:44:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:25,116 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 376 transitions. [2022-11-03 01:44:25,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.206896551724138) internal successors, (93), 31 states have internal predecessors, (93), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (40), 14 states have call predecessors, (40), 28 states have call successors, (40) [2022-11-03 01:44:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 376 transitions. [2022-11-03 01:44:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10551 [2022-11-03 01:44:26,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:26,298 INFO L195 NwaCegarLoop]: trace histogram [1549, 1549, 1253, 774, 774, 774, 774, 774, 774, 774, 479, 296, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:26,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:26,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:44:26,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:44:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1628536163, now seen corresponding path program 14 times [2022-11-03 01:44:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136233307] [2022-11-03 01:44:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6776686 backedges. 10777 proven. 111027 refuted. 0 times theorem prover too weak. 6654882 trivial. 0 not checked. [2022-11-03 01:46:47,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136233307] [2022-11-03 01:46:47,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136233307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146372763] [2022-11-03 01:46:47,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:46:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:47,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:47,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:46:48,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2022-11-03 01:46:48,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:48,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:46:48,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6776686 backedges. 10777 proven. 111027 refuted. 0 times theorem prover too weak. 6654882 trivial. 0 not checked. [2022-11-03 01:46:49,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6776686 backedges. 10777 proven. 111287 refuted. 0 times theorem prover too weak. 6654622 trivial. 0 not checked. [2022-11-03 01:47:29,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146372763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:29,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [693554568] [2022-11-03 01:47:29,801 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:47:29,801 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:29,802 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-03 01:47:29,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2022-11-03 01:47:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146800504] [2022-11-03 01:47:29,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:29,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 01:47:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 01:47:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 01:47:29,813 INFO L87 Difference]: Start difference. First operand 220 states and 376 transitions. Second operand has 33 states, 31 states have (on average 3.193548387096774) internal successors, (99), 33 states have internal predecessors, (99), 30 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (43), 15 states have call predecessors, (43), 30 states have call successors, (43) [2022-11-03 01:47:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:30,455 INFO L93 Difference]: Finished difference Result 229 states and 403 transitions. [2022-11-03 01:47:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:47:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.193548387096774) internal successors, (99), 33 states have internal predecessors, (99), 30 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (43), 15 states have call predecessors, (43), 30 states have call successors, (43) Word has length 10550 [2022-11-03 01:47:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:30,469 INFO L225 Difference]: With dead ends: 229 [2022-11-03 01:47:30,469 INFO L226 Difference]: Without dead ends: 225 [2022-11-03 01:47:30,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21143 GetRequests, 21084 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 01:47:30,471 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 663 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:30,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 108 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:47:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-03 01:47:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-11-03 01:47:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 157 states have internal predecessors, (165), 47 states have call successors, (47), 38 states have call predecessors, (47), 16 states have return successors, (185), 29 states have call predecessors, (185), 47 states have call successors, (185) [2022-11-03 01:47:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 397 transitions. [2022-11-03 01:47:30,493 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 397 transitions. Word has length 10550 [2022-11-03 01:47:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:30,496 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 397 transitions. [2022-11-03 01:47:30,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.193548387096774) internal successors, (99), 33 states have internal predecessors, (99), 30 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (43), 15 states have call predecessors, (43), 30 states have call successors, (43) [2022-11-03 01:47:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 397 transitions. [2022-11-03 01:47:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17360 [2022-11-03 01:47:32,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:32,640 INFO L195 NwaCegarLoop]: trace histogram [2549, 2549, 2062, 1274, 1274, 1274, 1274, 1274, 1274, 1274, 788, 487, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:32,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:32,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:47:32,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:47:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 272488805, now seen corresponding path program 15 times [2022-11-03 01:47:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:32,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495671657] [2022-11-03 01:47:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18358199 backedges. 17948 proven. 197830 refuted. 0 times theorem prover too weak. 18142421 trivial. 0 not checked. [2022-11-03 01:53:23,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495671657] [2022-11-03 01:53:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495671657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881179066] [2022-11-03 01:53:23,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:23,420 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:23,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bc7a58-64e3-43a0-a8d3-53d611e99803/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:53:28,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:28,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:28,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 30893 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 01:53:28,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18358199 backedges. 8944348 proven. 153262 refuted. 0 times theorem prover too weak. 9260589 trivial. 0 not checked. [2022-11-03 01:53:30,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18358199 backedges. 78322 proven. 311386 refuted. 0 times theorem prover too weak. 17968491 trivial. 0 not checked. [2022-11-03 01:54:46,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881179066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:46,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1660460454] [2022-11-03 01:54:46,768 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:54:46,768 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:46,769 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-03 01:54:46,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:46,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31, 55] total 60 [2022-11-03 01:54:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353282952] [2022-11-03 01:54:46,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 01:54:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 01:54:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3032, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 01:54:46,791 INFO L87 Difference]: Start difference. First operand 225 states and 397 transitions. Second operand has 60 states, 59 states have (on average 3.1864406779661016) internal successors, (188), 60 states have internal predecessors, (188), 56 states have call successors, (60), 2 states have call predecessors, (60), 30 states have return successors, (86), 29 states have call predecessors, (86), 56 states have call successors, (86) [2022-11-03 01:54:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:51,377 INFO L93 Difference]: Finished difference Result 590 states and 1536 transitions. [2022-11-03 01:54:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-03 01:54:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 3.1864406779661016) internal successors, (188), 60 states have internal predecessors, (188), 56 states have call successors, (60), 2 states have call predecessors, (60), 30 states have return successors, (86), 29 states have call predecessors, (86), 56 states have call successors, (86) Word has length 17359 [2022-11-03 01:54:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:51,393 INFO L225 Difference]: With dead ends: 590 [2022-11-03 01:54:51,393 INFO L226 Difference]: Without dead ends: 375 [2022-11-03 01:54:51,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34833 GetRequests, 34664 SyntacticMatches, 27 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5654 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4315, Invalid=16277, Unknown=0, NotChecked=0, Total=20592 [2022-11-03 01:54:51,404 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1282 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 4204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 6065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4204 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:51,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 360 Invalid, 6065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4204 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-03 01:54:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-03 01:54:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 267. [2022-11-03 01:54:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 191 states have (on average 1.0157068062827226) internal successors, (194), 188 states have internal predecessors, (194), 58 states have call successors, (58), 47 states have call predecessors, (58), 17 states have return successors, (204), 31 states have call predecessors, (204), 58 states have call successors, (204) [2022-11-03 01:54:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 456 transitions. [2022-11-03 01:54:51,432 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 456 transitions. Word has length 17359 [2022-11-03 01:54:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:51,437 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 456 transitions. [2022-11-03 01:54:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 3.1864406779661016) internal successors, (188), 60 states have internal predecessors, (188), 56 states have call successors, (60), 2 states have call predecessors, (60), 30 states have return successors, (86), 29 states have call predecessors, (86), 56 states have call successors, (86) [2022-11-03 01:54:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 456 transitions.