./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:57:03,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:57:03,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:57:03,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:57:03,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:57:03,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:57:03,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:57:03,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:57:03,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:57:03,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:57:03,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:57:03,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:57:03,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:57:03,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:57:03,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:57:03,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:57:03,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:57:03,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:57:03,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:57:03,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:57:03,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:57:03,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:57:03,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:57:03,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:57:04,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:57:04,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:57:04,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:57:04,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:57:04,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:57:04,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:57:04,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:57:04,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:57:04,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:57:04,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:57:04,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:57:04,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:57:04,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:57:04,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:57:04,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:57:04,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:57:04,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:57:04,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:57:04,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:57:04,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:57:04,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:57:04,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:57:04,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:57:04,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:57:04,068 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:57:04,068 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:57:04,068 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:57:04,068 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:57:04,069 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:57:04,070 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:57:04,070 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:57:04,070 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:57:04,070 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:57:04,071 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:57:04,071 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:57:04,071 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:57:04,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:57:04,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:57:04,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:57:04,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:57:04,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:57:04,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:57:04,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:57:04,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:57:04,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:57:04,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:57:04,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:57:04,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:57:04,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:57:04,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:57:04,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:57:04,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:57:04,076 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:57:04,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:57:04,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:57:04,077 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:57:04,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:57:04,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:57:04,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:57:04,078 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_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2022-11-23 13:57:04,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:57:04,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:57:04,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:57:04,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:57:04,381 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:57:04,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-23 13:57:07,433 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:57:07,632 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:57:07,633 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-23 13:57:07,639 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/data/ea1189efe/5c2efd10efc24fea9bab946003de1cbb/FLAG19d374b09 [2022-11-23 13:57:07,654 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/data/ea1189efe/5c2efd10efc24fea9bab946003de1cbb [2022-11-23 13:57:07,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:57:07,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:57:07,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:57:07,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:57:07,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:57:07,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57090036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07, skipping insertion in model container [2022-11-23 13:57:07,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:57:07,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:57:07,823 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-23 13:57:07,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:57:07,840 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:57:07,852 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-23 13:57:07,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:57:07,866 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:57:07,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07 WrapperNode [2022-11-23 13:57:07,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:57:07,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:57:07,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:57:07,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:57:07,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,901 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-23 13:57:07,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:57:07,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:57:07,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:57:07,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:57:07,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:57:07,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:57:07,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:57:07,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:57:07,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (1/1) ... [2022-11-23 13:57:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:57:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:07,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:57:08,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:57:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:57:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:57:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-11-23 13:57:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-11-23 13:57:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-11-23 13:57:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-11-23 13:57:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:57:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:57:08,111 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:57:08,113 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:57:08,229 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:57:08,244 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:57:08,247 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:57:08,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:57:08 BoogieIcfgContainer [2022-11-23 13:57:08,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:57:08,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:57:08,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:57:08,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:57:08,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:57:07" (1/3) ... [2022-11-23 13:57:08,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d70b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:57:08, skipping insertion in model container [2022-11-23 13:57:08,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:07" (2/3) ... [2022-11-23 13:57:08,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d70b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:57:08, skipping insertion in model container [2022-11-23 13:57:08,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:57:08" (3/3) ... [2022-11-23 13:57:08,273 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-11-23 13:57:08,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:57:08,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 13:57:08,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:57:08,372 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;@378a0363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:57:08,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 13:57:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 13:57:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:57:08,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:08,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:08,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2022-11-23 13:57:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:08,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815152660] [2022-11-23 13:57:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:08,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:08,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815152660] [2022-11-23 13:57:08,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815152660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:57:08,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:57:08,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:57:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599779845] [2022-11-23 13:57:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:57:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:57:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:57:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:57:08,736 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:57:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:08,804 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-23 13:57:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:57:08,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-11-23 13:57:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:08,814 INFO L225 Difference]: With dead ends: 36 [2022-11-23 13:57:08,814 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 13:57:08,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:57:08,821 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:57:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 13:57:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-23 13:57:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 13:57:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-23 13:57:08,863 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-11-23 13:57:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:08,865 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 13:57:08,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:57:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-23 13:57:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:57:08,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:08,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:57:08,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2022-11-23 13:57:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:08,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321293374] [2022-11-23 13:57:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:09,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321293374] [2022-11-23 13:57:09,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321293374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:57:09,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:57:09,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:57:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387036013] [2022-11-23 13:57:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:57:09,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:57:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:09,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:57:09,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:57:09,010 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:57:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:09,077 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-11-23 13:57:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:57:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-23 13:57:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:09,079 INFO L225 Difference]: With dead ends: 32 [2022-11-23 13:57:09,095 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 13:57:09,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:57:09,097 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:57:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 13:57:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-23 13:57:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 13:57:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-23 13:57:09,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2022-11-23 13:57:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:09,106 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 13:57:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:57:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-23 13:57:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 13:57:09,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:09,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:57:09,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2022-11-23 13:57:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:09,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465362424] [2022-11-23 13:57:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:57:09,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:09,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465362424] [2022-11-23 13:57:09,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465362424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:09,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553500624] [2022-11-23 13:57:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:09,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:09,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:09,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:57:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:09,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:57:09,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:57:09,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:57:09,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553500624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:09,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [517468336] [2022-11-23 13:57:09,900 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-23 13:57:09,900 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:09,904 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:57:09,910 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:57:09,910 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:57:10,041 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2022-11-23 13:57:10,116 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2022-11-23 13:57:10,127 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:57:10,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [517468336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:57:10,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:10,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2022-11-23 13:57:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105759317] [2022-11-23 13:57:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:57:10,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:57:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:57:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:57:10,466 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 13:57:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:10,613 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-11-23 13:57:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:57:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-11-23 13:57:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:10,615 INFO L225 Difference]: With dead ends: 68 [2022-11-23 13:57:10,615 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 13:57:10,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:57:10,618 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:10,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:57:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 13:57:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-11-23 13:57:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-23 13:57:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-23 13:57:10,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2022-11-23 13:57:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:10,634 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-23 13:57:10,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 13:57:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-23 13:57:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 13:57:10,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:10,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:10,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 13:57:10,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:10,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2022-11-23 13:57:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:10,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485640167] [2022-11-23 13:57:10,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:57:11,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485640167] [2022-11-23 13:57:11,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485640167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775504112] [2022-11-23 13:57:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:11,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:11,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:57:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:11,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:57:11,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 13:57:11,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 13:57:11,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775504112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:11,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1522585005] [2022-11-23 13:57:11,622 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:11,623 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:11,624 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:11,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:11,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2022-11-23 13:57:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673182776] [2022-11-23 13:57:11,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:11,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:57:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:57:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:57:11,636 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:57:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:11,881 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-11-23 13:57:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:57:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2022-11-23 13:57:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:11,890 INFO L225 Difference]: With dead ends: 85 [2022-11-23 13:57:11,891 INFO L226 Difference]: Without dead ends: 53 [2022-11-23 13:57:11,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:57:11,897 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:11,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 94 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:57:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-23 13:57:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-23 13:57:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-23 13:57:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-11-23 13:57:11,921 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2022-11-23 13:57:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:11,922 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-11-23 13:57:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:57:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-11-23 13:57:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 13:57:11,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:11,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:11,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:12,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2022-11-23 13:57:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800913503] [2022-11-23 13:57:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 13:57:12,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800913503] [2022-11-23 13:57:12,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800913503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:12,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088511895] [2022-11-23 13:57:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:12,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:12,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:12,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:12,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:57:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:12,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:57:12,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:57:12,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 13:57:12,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088511895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:12,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1140952052] [2022-11-23 13:57:12,837 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:12,838 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:12,839 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:12,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:12,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-11-23 13:57:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663702425] [2022-11-23 13:57:12,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:12,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:57:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:57:12,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:57:12,843 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:57:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:13,419 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2022-11-23 13:57:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:57:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-11-23 13:57:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:13,422 INFO L225 Difference]: With dead ends: 121 [2022-11-23 13:57:13,422 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 13:57:13,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:57:13,424 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:13,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 198 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:57:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 13:57:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-23 13:57:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-11-23 13:57:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2022-11-23 13:57:13,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2022-11-23 13:57:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:13,442 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2022-11-23 13:57:13,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 13:57:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2022-11-23 13:57:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 13:57:13,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:13,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:13,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:13,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:13,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2022-11-23 13:57:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:13,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175156114] [2022-11-23 13:57:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 13:57:13,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:13,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175156114] [2022-11-23 13:57:13,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175156114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:13,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18961591] [2022-11-23 13:57:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:13,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:13,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:13,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:57:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:13,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 13:57:13,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 13:57:14,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 13:57:14,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18961591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:14,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056517044] [2022-11-23 13:57:14,598 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:14,598 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:14,598 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:14,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:14,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2022-11-23 13:57:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387323418] [2022-11-23 13:57:14,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:57:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:57:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:57:14,600 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 13:57:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:14,870 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2022-11-23 13:57:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:57:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2022-11-23 13:57:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:14,873 INFO L225 Difference]: With dead ends: 119 [2022-11-23 13:57:14,874 INFO L226 Difference]: Without dead ends: 97 [2022-11-23 13:57:14,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:57:14,875 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:14,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 94 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-23 13:57:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-11-23 13:57:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2022-11-23 13:57:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2022-11-23 13:57:14,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2022-11-23 13:57:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:14,916 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2022-11-23 13:57:14,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 13:57:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-11-23 13:57:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-23 13:57:14,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:14,924 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:14,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:15,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:15,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2022-11-23 13:57:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465764191] [2022-11-23 13:57:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-23 13:57:15,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:15,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465764191] [2022-11-23 13:57:15,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465764191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056157083] [2022-11-23 13:57:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:15,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:15,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:57:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:15,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:57:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-23 13:57:15,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-23 13:57:16,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056157083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:16,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646572850] [2022-11-23 13:57:16,514 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:16,514 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:16,514 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:16,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:16,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-11-23 13:57:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856644530] [2022-11-23 13:57:16,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:16,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 13:57:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 13:57:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:57:16,518 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-23 13:57:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:17,395 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2022-11-23 13:57:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 13:57:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2022-11-23 13:57:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:17,398 INFO L225 Difference]: With dead ends: 204 [2022-11-23 13:57:17,398 INFO L226 Difference]: Without dead ends: 115 [2022-11-23 13:57:17,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 13:57:17,401 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 138 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 267 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:57:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-23 13:57:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-11-23 13:57:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2022-11-23 13:57:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2022-11-23 13:57:17,419 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2022-11-23 13:57:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:17,419 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2022-11-23 13:57:17,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-23 13:57:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2022-11-23 13:57:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-23 13:57:17,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:17,423 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:17,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:17,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 13:57:17,630 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2022-11-23 13:57:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:17,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785469972] [2022-11-23 13:57:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-11-23 13:57:17,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:17,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785469972] [2022-11-23 13:57:17,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785469972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:17,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316350099] [2022-11-23 13:57:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:17,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:17,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:57:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:17,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:57:17,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-11-23 13:57:18,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-23 13:57:19,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316350099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:19,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1487999880] [2022-11-23 13:57:19,467 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:19,467 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:19,467 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:19,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2022-11-23 13:57:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60662139] [2022-11-23 13:57:19,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:57:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:57:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:57:19,471 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:57:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:19,823 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2022-11-23 13:57:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:57:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 130 [2022-11-23 13:57:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:19,825 INFO L225 Difference]: With dead ends: 191 [2022-11-23 13:57:19,825 INFO L226 Difference]: Without dead ends: 103 [2022-11-23 13:57:19,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 241 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:57:19,827 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:19,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 143 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-23 13:57:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-11-23 13:57:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2022-11-23 13:57:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2022-11-23 13:57:19,841 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2022-11-23 13:57:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:19,842 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2022-11-23 13:57:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:57:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2022-11-23 13:57:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-23 13:57:19,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:19,844 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:19,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 13:57:20,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:20,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2022-11-23 13:57:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:20,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943448765] [2022-11-23 13:57:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-23 13:57:20,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:20,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943448765] [2022-11-23 13:57:20,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943448765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992944312] [2022-11-23 13:57:20,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:57:20,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:20,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:20,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:57:20,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 13:57:20,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:20,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:57:20,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-23 13:57:20,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-11-23 13:57:20,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992944312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:20,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1592058012] [2022-11-23 13:57:20,976 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:20,976 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:20,976 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:20,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2022-11-23 13:57:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347383777] [2022-11-23 13:57:20,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:57:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:57:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:57:20,980 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-11-23 13:57:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:21,258 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2022-11-23 13:57:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:57:21,258 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2022-11-23 13:57:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:21,264 INFO L225 Difference]: With dead ends: 132 [2022-11-23 13:57:21,264 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 13:57:21,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:57:21,268 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:21,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 129 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 13:57:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2022-11-23 13:57:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2022-11-23 13:57:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2022-11-23 13:57:21,291 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2022-11-23 13:57:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:21,292 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2022-11-23 13:57:21,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-11-23 13:57:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2022-11-23 13:57:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-23 13:57:21,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:21,299 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:21,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:21,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:21,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2022-11-23 13:57:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:21,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280486515] [2022-11-23 13:57:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-11-23 13:57:21,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:21,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280486515] [2022-11-23 13:57:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280486515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:21,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856768376] [2022-11-23 13:57:21,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:57:21,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:21,805 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:21,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:57:21,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:57:21,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:21,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 13:57:21,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2022-11-23 13:57:22,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-11-23 13:57:22,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856768376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:22,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533229937] [2022-11-23 13:57:22,929 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:22,930 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:22,930 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:22,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:22,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2022-11-23 13:57:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339322108] [2022-11-23 13:57:22,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:22,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:57:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:57:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:57:22,932 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-23 13:57:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:23,178 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2022-11-23 13:57:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:57:23,179 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2022-11-23 13:57:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:23,180 INFO L225 Difference]: With dead ends: 213 [2022-11-23 13:57:23,180 INFO L226 Difference]: Without dead ends: 113 [2022-11-23 13:57:23,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:57:23,183 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:23,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 151 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:57:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-23 13:57:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-23 13:57:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2022-11-23 13:57:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2022-11-23 13:57:23,202 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2022-11-23 13:57:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:23,204 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2022-11-23 13:57:23,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-23 13:57:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2022-11-23 13:57:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-11-23 13:57:23,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:23,209 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:23,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:23,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 13:57:23,409 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2022-11-23 13:57:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528643835] [2022-11-23 13:57:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2022-11-23 13:57:23,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:23,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528643835] [2022-11-23 13:57:23,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528643835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:23,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274155919] [2022-11-23 13:57:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:23,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:23,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:57:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:23,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:57:23,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2022-11-23 13:57:23,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-11-23 13:57:25,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274155919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [842992133] [2022-11-23 13:57:25,387 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:25,387 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:25,388 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:25,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:25,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2022-11-23 13:57:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649935603] [2022-11-23 13:57:25,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:25,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:57:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:57:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:57:25,391 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 13:57:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:25,630 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2022-11-23 13:57:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:57:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2022-11-23 13:57:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:25,633 INFO L225 Difference]: With dead ends: 142 [2022-11-23 13:57:25,633 INFO L226 Difference]: Without dead ends: 128 [2022-11-23 13:57:25,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:57:25,634 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:25,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 106 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-23 13:57:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2022-11-23 13:57:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2022-11-23 13:57:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2022-11-23 13:57:25,648 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2022-11-23 13:57:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:25,649 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2022-11-23 13:57:25,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 13:57:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2022-11-23 13:57:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-23 13:57:25,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:25,653 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:25,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:25,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 13:57:25,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2022-11-23 13:57:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:25,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698236120] [2022-11-23 13:57:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2022-11-23 13:57:26,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:26,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698236120] [2022-11-23 13:57:26,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698236120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:26,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212060523] [2022-11-23 13:57:26,397 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:57:26,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:26,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:26,399 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:26,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:57:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:26,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:57:26,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2022-11-23 13:57:26,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2022-11-23 13:57:28,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212060523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674429442] [2022-11-23 13:57:28,853 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:28,853 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:28,853 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:28,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:28,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 31 [2022-11-23 13:57:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857675435] [2022-11-23 13:57:28,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:28,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 13:57:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 13:57:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:57:28,858 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2022-11-23 13:57:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:30,433 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2022-11-23 13:57:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 13:57:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) Word has length 239 [2022-11-23 13:57:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:30,437 INFO L225 Difference]: With dead ends: 300 [2022-11-23 13:57:30,437 INFO L226 Difference]: Without dead ends: 182 [2022-11-23 13:57:30,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 460 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2022-11-23 13:57:30,440 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 194 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:30,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 356 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:57:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-23 13:57:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2022-11-23 13:57:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2022-11-23 13:57:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2022-11-23 13:57:30,458 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2022-11-23 13:57:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:30,458 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2022-11-23 13:57:30,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2022-11-23 13:57:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2022-11-23 13:57:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2022-11-23 13:57:30,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:30,483 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 54, 53, 53, 45, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 12, 12, 8, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:30,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:30,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1043357236, now seen corresponding path program 5 times [2022-11-23 13:57:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221988488] [2022-11-23 13:57:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 279 proven. 1827 refuted. 0 times theorem prover too weak. 17819 trivial. 0 not checked. [2022-11-23 13:57:32,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221988488] [2022-11-23 13:57:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221988488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595174011] [2022-11-23 13:57:32,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:57:32,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:32,097 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:32,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:57:32,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:57:32,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:32,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:57:32,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2022-11-23 13:57:32,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2022-11-23 13:57:34,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595174011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:34,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331294366] [2022-11-23 13:57:34,560 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:34,560 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:34,561 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:34,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-11-23 13:57:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847610189] [2022-11-23 13:57:34,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:34,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:57:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:57:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:57:34,565 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-23 13:57:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:34,999 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2022-11-23 13:57:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:57:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 816 [2022-11-23 13:57:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:35,003 INFO L225 Difference]: With dead ends: 351 [2022-11-23 13:57:35,003 INFO L226 Difference]: Without dead ends: 202 [2022-11-23 13:57:35,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1659 GetRequests, 1628 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:57:35,006 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 119 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:35,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 108 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:57:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-23 13:57:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2022-11-23 13:57:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2022-11-23 13:57:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2022-11-23 13:57:35,032 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 816 [2022-11-23 13:57:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:35,032 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2022-11-23 13:57:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-23 13:57:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2022-11-23 13:57:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-11-23 13:57:35,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:35,043 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:35,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:35,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1333422328, now seen corresponding path program 6 times [2022-11-23 13:57:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:35,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555738726] [2022-11-23 13:57:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 294 proven. 759 refuted. 0 times theorem prover too weak. 5030 trivial. 0 not checked. [2022-11-23 13:57:35,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:35,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555738726] [2022-11-23 13:57:35,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555738726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:35,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169917807] [2022-11-23 13:57:35,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:57:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:35,902 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:35,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:57:36,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:57:36,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:36,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:57:36,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 2733 proven. 170 refuted. 0 times theorem prover too weak. 3180 trivial. 0 not checked. [2022-11-23 13:57:36,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 319 proven. 1329 refuted. 0 times theorem prover too weak. 4435 trivial. 0 not checked. [2022-11-23 13:57:39,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169917807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241123664] [2022-11-23 13:57:39,508 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:39,509 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:39,509 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:39,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:39,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 32 [2022-11-23 13:57:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293129105] [2022-11-23 13:57:39,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:39,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 13:57:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 13:57:39,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2022-11-23 13:57:39,513 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2022-11-23 13:57:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:40,922 INFO L93 Difference]: Finished difference Result 467 states and 957 transitions. [2022-11-23 13:57:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-23 13:57:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) Word has length 459 [2022-11-23 13:57:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:40,930 INFO L225 Difference]: With dead ends: 467 [2022-11-23 13:57:40,931 INFO L226 Difference]: Without dead ends: 200 [2022-11-23 13:57:40,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 894 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2022-11-23 13:57:40,935 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 175 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:40,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 420 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:57:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-23 13:57:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2022-11-23 13:57:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 120 states have internal predecessors, (136), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (90), 35 states have call predecessors, (90), 33 states have call successors, (90) [2022-11-23 13:57:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2022-11-23 13:57:40,956 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 459 [2022-11-23 13:57:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:40,956 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2022-11-23 13:57:40,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2022-11-23 13:57:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2022-11-23 13:57:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-11-23 13:57:40,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:40,960 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 22, 22, 20, 18, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 6, 5, 4, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:40,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:41,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 13:57:41,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1396991830, now seen corresponding path program 7 times [2022-11-23 13:57:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:41,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686054821] [2022-11-23 13:57:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 241 proven. 424 refuted. 0 times theorem prover too weak. 2286 trivial. 0 not checked. [2022-11-23 13:57:41,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:41,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686054821] [2022-11-23 13:57:41,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686054821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:41,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273229573] [2022-11-23 13:57:41,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:57:41,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:41,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:41,547 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:41,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:57:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:41,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:57:41,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 241 proven. 424 refuted. 0 times theorem prover too weak. 2286 trivial. 0 not checked. [2022-11-23 13:57:41,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 243 proven. 438 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2022-11-23 13:57:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273229573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384538705] [2022-11-23 13:57:43,505 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:43,505 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:43,506 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:43,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:43,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2022-11-23 13:57:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344392136] [2022-11-23 13:57:43,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:43,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:57:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:57:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:57:43,511 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2022-11-23 13:57:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:43,719 INFO L93 Difference]: Finished difference Result 205 states and 312 transitions. [2022-11-23 13:57:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:57:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) Word has length 323 [2022-11-23 13:57:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:43,724 INFO L225 Difference]: With dead ends: 205 [2022-11-23 13:57:43,724 INFO L226 Difference]: Without dead ends: 191 [2022-11-23 13:57:43,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 637 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:57:43,727 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:43,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 98 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:57:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-23 13:57:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2022-11-23 13:57:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.104) internal successors, (138), 122 states have internal predecessors, (138), 33 states have call successors, (33), 22 states have call predecessors, (33), 22 states have return successors, (93), 36 states have call predecessors, (93), 33 states have call successors, (93) [2022-11-23 13:57:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 264 transitions. [2022-11-23 13:57:43,744 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 264 transitions. Word has length 323 [2022-11-23 13:57:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:43,744 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 264 transitions. [2022-11-23 13:57:43,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 17 states have internal predecessors, (62), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2022-11-23 13:57:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 264 transitions. [2022-11-23 13:57:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2022-11-23 13:57:43,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:43,748 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:43,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:43,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 13:57:43,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2040161751, now seen corresponding path program 8 times [2022-11-23 13:57:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:43,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158239157] [2022-11-23 13:57:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2022-11-23 13:57:44,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:44,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158239157] [2022-11-23 13:57:44,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158239157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:44,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469348063] [2022-11-23 13:57:44,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:57:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:44,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:44,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 13:57:44,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-23 13:57:44,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:44,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 13:57:44,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 586 proven. 92 refuted. 0 times theorem prover too weak. 3692 trivial. 0 not checked. [2022-11-23 13:57:44,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 588 proven. 100 refuted. 0 times theorem prover too weak. 3682 trivial. 0 not checked. [2022-11-23 13:57:46,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469348063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:46,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764770358] [2022-11-23 13:57:46,159 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:46,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:46,160 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:46,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:46,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 18 [2022-11-23 13:57:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674815194] [2022-11-23 13:57:46,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:46,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 13:57:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 13:57:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:57:46,167 INFO L87 Difference]: Start difference. First operand 181 states and 264 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) [2022-11-23 13:57:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:46,415 INFO L93 Difference]: Finished difference Result 201 states and 297 transitions. [2022-11-23 13:57:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 13:57:46,416 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) Word has length 391 [2022-11-23 13:57:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:46,419 INFO L225 Difference]: With dead ends: 201 [2022-11-23 13:57:46,419 INFO L226 Difference]: Without dead ends: 187 [2022-11-23 13:57:46,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 771 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-11-23 13:57:46,420 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:46,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 102 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-23 13:57:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-11-23 13:57:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 127 states have (on average 1.1023622047244095) internal successors, (140), 124 states have internal predecessors, (140), 33 states have call successors, (33), 22 states have call predecessors, (33), 23 states have return successors, (87), 37 states have call predecessors, (87), 33 states have call successors, (87) [2022-11-23 13:57:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2022-11-23 13:57:46,438 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 391 [2022-11-23 13:57:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:46,439 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2022-11-23 13:57:46,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) [2022-11-23 13:57:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2022-11-23 13:57:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2022-11-23 13:57:46,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:46,445 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 45, 45, 36, 33, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 14, 12, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:46,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:46,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:46,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash -499830850, now seen corresponding path program 9 times [2022-11-23 13:57:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:46,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847290722] [2022-11-23 13:57:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11194 backedges. 406 proven. 1050 refuted. 0 times theorem prover too weak. 9738 trivial. 0 not checked. [2022-11-23 13:57:47,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:47,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847290722] [2022-11-23 13:57:47,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847290722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:47,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051359053] [2022-11-23 13:57:47,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:57:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:47,439 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:47,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 13:57:47,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:57:47,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:47,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:57:47,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11194 backedges. 5243 proven. 356 refuted. 0 times theorem prover too weak. 5595 trivial. 0 not checked. [2022-11-23 13:57:48,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11194 backedges. 439 proven. 2182 refuted. 0 times theorem prover too weak. 8573 trivial. 0 not checked. [2022-11-23 13:57:51,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051359053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:51,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1872526494] [2022-11-23 13:57:51,918 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:51,918 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:51,919 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:51,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:51,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 23] total 35 [2022-11-23 13:57:51,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509867081] [2022-11-23 13:57:51,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:51,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 13:57:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:51,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 13:57:51,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:57:51,923 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand has 35 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 35 states have internal predecessors, (123), 27 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) [2022-11-23 13:57:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:53,076 INFO L93 Difference]: Finished difference Result 383 states and 566 transitions. [2022-11-23 13:57:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-23 13:57:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 35 states have internal predecessors, (123), 27 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) Word has length 618 [2022-11-23 13:57:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:53,079 INFO L225 Difference]: With dead ends: 383 [2022-11-23 13:57:53,079 INFO L226 Difference]: Without dead ends: 205 [2022-11-23 13:57:53,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 1207 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=3223, Unknown=0, NotChecked=0, Total=3782 [2022-11-23 13:57:53,082 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 189 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:53,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 313 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:57:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-23 13:57:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-11-23 13:57:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.078740157480315) internal successors, (137), 125 states have internal predecessors, (137), 34 states have call successors, (34), 22 states have call predecessors, (34), 23 states have return successors, (76), 37 states have call predecessors, (76), 34 states have call successors, (76) [2022-11-23 13:57:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions. [2022-11-23 13:57:53,102 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 618 [2022-11-23 13:57:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:53,102 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 247 transitions. [2022-11-23 13:57:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 35 states have internal predecessors, (123), 27 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) [2022-11-23 13:57:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions. [2022-11-23 13:57:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2022-11-23 13:57:53,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:53,108 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 44, 44, 38, 36, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 16, 13, 9, 8, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:53,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:53,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:57:53,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 631449604, now seen corresponding path program 10 times [2022-11-23 13:57:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711267267] [2022-11-23 13:57:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11377 backedges. 561 proven. 912 refuted. 0 times theorem prover too weak. 9904 trivial. 0 not checked. [2022-11-23 13:57:54,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:54,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711267267] [2022-11-23 13:57:54,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711267267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:54,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570638229] [2022-11-23 13:57:54,154 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:57:54,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:54,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:54,155 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:54,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 13:57:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:57:54,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11377 backedges. 671 proven. 1171 refuted. 0 times theorem prover too weak. 9535 trivial. 0 not checked. [2022-11-23 13:57:54,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11377 backedges. 671 proven. 1201 refuted. 0 times theorem prover too weak. 9505 trivial. 0 not checked. [2022-11-23 13:57:58,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570638229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1538660243] [2022-11-23 13:57:58,069 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:57:58,069 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:58,069 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:57:58,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:58,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2022-11-23 13:57:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843660486] [2022-11-23 13:57:58,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:58,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 13:57:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 13:57:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:57:58,073 INFO L87 Difference]: Start difference. First operand 185 states and 247 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2022-11-23 13:57:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:58,414 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2022-11-23 13:57:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:57:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) Word has length 623 [2022-11-23 13:57:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:58,418 INFO L225 Difference]: With dead ends: 203 [2022-11-23 13:57:58,418 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 13:57:58,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1229 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:57:58,420 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:58,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 258 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:57:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 13:57:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2022-11-23 13:57:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 119 states have internal predecessors, (131), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (57), 35 states have call predecessors, (57), 32 states have call successors, (57) [2022-11-23 13:57:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2022-11-23 13:57:58,435 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 623 [2022-11-23 13:57:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:58,436 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2022-11-23 13:57:58,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2022-11-23 13:57:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2022-11-23 13:57:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2022-11-23 13:57:58,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:58,441 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 36, 36, 32, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 14, 11, 7, 5, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:58,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-23 13:57:58,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 13:57:58,653 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:57:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -595623595, now seen corresponding path program 11 times [2022-11-23 13:57:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:58,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471285771] [2022-11-23 13:57:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 358 proven. 561 refuted. 0 times theorem prover too weak. 6391 trivial. 0 not checked. [2022-11-23 13:57:59,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:59,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471285771] [2022-11-23 13:57:59,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471285771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:59,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371551045] [2022-11-23 13:57:59,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:57:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:59,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:59,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:59,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 13:57:59,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:57:59,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:59,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:57:59,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 799 proven. 6 refuted. 0 times theorem prover too weak. 6505 trivial. 0 not checked. [2022-11-23 13:57:59,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:58:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 799 proven. 6 refuted. 0 times theorem prover too weak. 6505 trivial. 0 not checked. [2022-11-23 13:58:00,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371551045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:58:00,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91629131] [2022-11-23 13:58:00,845 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:58:00,845 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:58:00,846 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:58:00,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:58:00,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-11-23 13:58:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930761683] [2022-11-23 13:58:00,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:58:00,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:58:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:58:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:58:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:58:00,850 INFO L87 Difference]: Start difference. First operand 176 states and 220 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 10 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-23 13:58:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:58:01,478 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2022-11-23 13:58:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 13:58:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 10 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Word has length 502 [2022-11-23 13:58:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:58:01,481 INFO L225 Difference]: With dead ends: 417 [2022-11-23 13:58:01,481 INFO L226 Difference]: Without dead ends: 189 [2022-11-23 13:58:01,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 994 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 13:58:01,484 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 93 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:58:01,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 161 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:58:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-23 13:58:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2022-11-23 13:58:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 108 states have internal predecessors, (120), 29 states have call successors, (29), 21 states have call predecessors, (29), 18 states have return successors, (44), 28 states have call predecessors, (44), 29 states have call successors, (44) [2022-11-23 13:58:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2022-11-23 13:58:01,498 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 502 [2022-11-23 13:58:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:58:01,499 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2022-11-23 13:58:01,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 10 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-23 13:58:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-11-23 13:58:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-11-23 13:58:01,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:58:01,504 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 39, 39, 32, 32, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 13, 12, 8, 7, 1, 1, 1, 1, 1, 1] [2022-11-23 13:58:01,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 13:58:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:58:01,711 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:58:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:58:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1426990182, now seen corresponding path program 12 times [2022-11-23 13:58:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:58:01,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946046655] [2022-11-23 13:58:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:58:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:58:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:58:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 832 proven. 429 refuted. 0 times theorem prover too weak. 7259 trivial. 0 not checked. [2022-11-23 13:58:02,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:58:02,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946046655] [2022-11-23 13:58:02,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946046655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:58:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576945417] [2022-11-23 13:58:02,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:58:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:58:02,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:58:02,394 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:58:02,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 13:58:02,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:58:02,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:58:02,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 13:58:02,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:58:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 955 proven. 1753 refuted. 0 times theorem prover too weak. 5812 trivial. 0 not checked. [2022-11-23 13:58:03,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:58:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 955 proven. 1798 refuted. 0 times theorem prover too weak. 5767 trivial. 0 not checked. [2022-11-23 13:58:07,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576945417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:58:07,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [920367323] [2022-11-23 13:58:07,793 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 13:58:07,794 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:58:07,794 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:58:07,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:58:07,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 31] total 41 [2022-11-23 13:58:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673679393] [2022-11-23 13:58:07,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:58:07,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 13:58:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:58:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 13:58:07,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 13:58:07,798 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) [2022-11-23 13:58:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:58:09,428 INFO L93 Difference]: Finished difference Result 300 states and 383 transitions. [2022-11-23 13:58:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 13:58:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) Word has length 541 [2022-11-23 13:58:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:58:09,431 INFO L225 Difference]: With dead ends: 300 [2022-11-23 13:58:09,431 INFO L226 Difference]: Without dead ends: 181 [2022-11-23 13:58:09,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 1043 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=821, Invalid=4879, Unknown=0, NotChecked=0, Total=5700 [2022-11-23 13:58:09,434 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 306 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:58:09,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 450 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 13:58:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-23 13:58:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2022-11-23 13:58:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 107 states have internal predecessors, (120), 28 states have call successors, (28), 22 states have call predecessors, (28), 17 states have return successors, (32), 26 states have call predecessors, (32), 28 states have call successors, (32) [2022-11-23 13:58:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2022-11-23 13:58:09,448 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 541 [2022-11-23 13:58:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:58:09,448 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2022-11-23 13:58:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) [2022-11-23 13:58:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2022-11-23 13:58:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-11-23 13:58:09,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:58:09,452 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2022-11-23 13:58:09,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 13:58:09,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:58:09,659 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:58:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:58:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1780384136, now seen corresponding path program 13 times [2022-11-23 13:58:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:58:09,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112408684] [2022-11-23 13:58:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:58:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:58:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:58:09,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:58:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:58:09,892 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:58:09,892 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:58:09,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 13:58:09,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 13:58:09,899 INFO L444 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:58:09,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:58:10,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:58:10 BoogieIcfgContainer [2022-11-23 13:58:10,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:58:10,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:58:10,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:58:10,009 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:58:10,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:57:08" (3/4) ... [2022-11-23 13:58:10,026 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 13:58:10,158 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 13:58:10,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:58:10,159 INFO L158 Benchmark]: Toolchain (without parser) took 62501.41ms. Allocated memory was 159.4MB in the beginning and 648.0MB in the end (delta: 488.6MB). Free memory was 112.3MB in the beginning and 270.3MB in the end (delta: -158.0MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,160 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:58:10,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.48ms. Allocated memory is still 159.4MB. Free memory was 111.8MB in the beginning and 101.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,161 INFO L158 Benchmark]: Boogie Preprocessor took 42.63ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 99.2MB in the end (delta: 971.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:58:10,161 INFO L158 Benchmark]: RCFGBuilder took 303.69ms. Allocated memory is still 159.4MB. Free memory was 99.2MB in the beginning and 88.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,161 INFO L158 Benchmark]: TraceAbstraction took 61753.25ms. Allocated memory was 159.4MB in the beginning and 648.0MB in the end (delta: 488.6MB). Free memory was 87.6MB in the beginning and 280.7MB in the end (delta: -193.1MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,162 INFO L158 Benchmark]: Witness Printer took 151.94ms. Allocated memory is still 648.0MB. Free memory was 280.7MB in the beginning and 270.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 13:58:10,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.48ms. Allocated memory is still 159.4MB. Free memory was 111.8MB in the beginning and 101.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.63ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 99.2MB in the end (delta: 971.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.69ms. Allocated memory is still 159.4MB. Free memory was 99.2MB in the beginning and 88.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61753.25ms. Allocated memory was 159.4MB in the beginning and 648.0MB in the end (delta: 488.6MB). Free memory was 87.6MB in the beginning and 280.7MB in the end (delta: -193.1MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. * Witness Printer took 151.94ms. Allocated memory is still 648.0MB. Free memory was 280.7MB in the beginning and 270.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [unknown-#in~n-unknown=8] [L10] COND FALSE !(n < 1) VAL [n=8, unknown-#in~n-unknown=8] [L12] COND FALSE !(n == 1) VAL [n=8, unknown-#in~n-unknown=8] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=7] [L20] COND FALSE !(n < 1) VAL [n=7, unknown-#in~n-unknown=7] [L22] COND FALSE !(n == 1) VAL [n=7, unknown-#in~n-unknown=7] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=6] [L10] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L12] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=5] [L20] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L22] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=3, n=5, unknown-#in~n-unknown=5] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=3, fibo1(n-2)=2, n=5, unknown-#in~n-unknown=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=5, n=6, unknown-#in~n-unknown=6] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=5, fibo2(n-2)=3, n=6, unknown-#in~n-unknown=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=8, n=7, unknown-#in~n-unknown=7] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=8, fibo1(n-2)=5, n=7, unknown-#in~n-unknown=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=13, n=8, unknown-#in~n-unknown=8] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=6] [L20] COND FALSE !(n < 1) VAL [n=6, unknown-#in~n-unknown=6] [L22] COND FALSE !(n == 1) VAL [n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=5] [L10] COND FALSE !(n < 1) VAL [n=5, unknown-#in~n-unknown=5] [L12] COND FALSE !(n == 1) VAL [n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=4] [L20] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L22] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=3] [L10] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L12] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=3, unknown-#in~n-unknown=3] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=1, n=3, unknown-#in~n-unknown=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=2, n=4, unknown-#in~n-unknown=4] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=2, fibo1(n-2)=1, n=4, unknown-#in~n-unknown=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=3, n=5, unknown-#in~n-unknown=5] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=3, fibo2(n-2)=2, n=5, unknown-#in~n-unknown=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=5, n=6, unknown-#in~n-unknown=6] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=4] [L10] COND FALSE !(n < 1) VAL [n=4, unknown-#in~n-unknown=4] [L12] COND FALSE !(n == 1) VAL [n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=3] [L20] COND FALSE !(n < 1) VAL [n=3, unknown-#in~n-unknown=3] [L22] COND FALSE !(n == 1) VAL [n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=2] [L10] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L12] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-1) VAL [unknown-#in~n-unknown=1] [L20] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=1, n=2, unknown-#in~n-unknown=2] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=1, fibo2(n-2)=0, n=2, unknown-#in~n-unknown=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=3, unknown-#in~n-unknown=3] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=1, n=3, unknown-#in~n-unknown=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [fibo2(n-1)=2, n=4, unknown-#in~n-unknown=4] [L15] CALL, EXPR fibo2(n-2) VAL [unknown-#in~n-unknown=2] [L20] COND FALSE !(n < 1) VAL [n=2, unknown-#in~n-unknown=2] [L22] COND FALSE !(n == 1) VAL [n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-1) VAL [unknown-#in~n-unknown=1] [L10] COND FALSE !(n < 1) VAL [n=1, unknown-#in~n-unknown=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\result=1, n=1, unknown-#in~n-unknown=1] [L25] RET, EXPR fibo1(n-1) VAL [fibo1(n-1)=1, n=2, unknown-#in~n-unknown=2] [L25] CALL, EXPR fibo1(n-2) VAL [unknown-#in~n-unknown=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\result=0, n=0, unknown-#in~n-unknown=0] [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=1, fibo1(n-2)=0, n=2, unknown-#in~n-unknown=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=2, fibo2(n-2)=1, n=4, unknown-#in~n-unknown=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [fibo1(n-1)=5, fibo1(n-2)=3, n=6, unknown-#in~n-unknown=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [fibo2(n-1)=13, fibo2(n-2)=8, n=8, unknown-#in~n-unknown=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 21, TraceHistogramMax: 66, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1888 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1805 mSDsluCounter, 3779 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3241 mSDsCounter, 1997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9439 IncrementalHoareTripleChecker+Invalid, 11436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1997 mSolverCounterUnsat, 538 mSDtfsCounter, 9439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11207 GetRequests, 10490 SyntacticMatches, 111 SemanticMatches, 606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=17, InterpolantAutomatonStates: 377, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 277 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 11192 NumberOfCodeBlocks, 9362 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 16034 ConstructedInterpolants, 0 QuantifiedInterpolants, 21462 SizeOfPredicates, 99 NumberOfNonLiveVariables, 8000 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 56 InterpolantComputations, 2 PerfectInterpolantSequences, 207797/228525 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 13:58:10,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512f7fdb-6bc4-4d48-94b0-7ad772228929/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE