./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh --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 be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 --- 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-2329fc7 [2022-12-14 15:35:37,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:35:37,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:35:38,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:35:38,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:35:38,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:35:38,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:35:38,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:35:38,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:35:38,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:35:38,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:35:38,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:35:38,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:35:38,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:35:38,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:35:38,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:35:38,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:35:38,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:35:38,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:35:38,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:35:38,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:35:38,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:35:38,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:35:38,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:35:38,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:35:38,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:35:38,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:35:38,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:35:38,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:35:38,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:35:38,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:35:38,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:35:38,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:35:38,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:35:38,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:35:38,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:35:38,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:35:38,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:35:38,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:35:38,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:35:38,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:35:38,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 15:35:38,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:35:38,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:35:38,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:35:38,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:35:38,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:35:38,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:35:38,072 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:35:38,072 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:35:38,073 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:35:38,073 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:35:38,073 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:35:38,073 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:35:38,073 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:35:38,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:35:38,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:35:38,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:35:38,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:35:38,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:35:38,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:35:38,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:35:38,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:35:38,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:35:38,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:35:38,076 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:35:38,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:35:38,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:35:38,077 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:35:38,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:35:38,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:35:38,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:35:38,077 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_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/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_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh 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 -> be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 [2022-12-14 15:35:38,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:35:38,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:35:38,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:35:38,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:35:38,262 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:35:38,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/recursive/Fibonacci03.c [2022-12-14 15:35:40,880 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:35:41,003 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:35:41,003 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/sv-benchmarks/c/recursive/Fibonacci03.c [2022-12-14 15:35:41,008 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/data/682f0842f/199e73ce8ab347c1a2e570ce8e6e4d06/FLAGdb875f834 [2022-12-14 15:35:41,019 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/data/682f0842f/199e73ce8ab347c1a2e570ce8e6e4d06 [2022-12-14 15:35:41,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:35:41,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:35:41,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:35:41,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:35:41,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:35:41,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5028a7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41, skipping insertion in model container [2022-12-14 15:35:41,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:35:41,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:35:41,165 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_b1b05aba-7032-4942-a273-65b24d2cb76c/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-12-14 15:35:41,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:35:41,177 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:35:41,188 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_b1b05aba-7032-4942-a273-65b24d2cb76c/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-12-14 15:35:41,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:35:41,199 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:35:41,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41 WrapperNode [2022-12-14 15:35:41,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:35:41,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:35:41,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:35:41,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:35:41,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,224 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-12-14 15:35:41,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:35:41,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:35:41,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:35:41,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:35:41,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:35:41,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:35:41,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:35:41,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:35:41,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (1/1) ... [2022-12-14 15:35:41,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:35:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:41,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:35:41,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:35:41,300 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-12-14 15:35:41,300 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-12-14 15:35:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:35:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:35:41,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:35:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:35:41,362 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:35:41,364 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:35:41,443 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:35:41,453 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:35:41,453 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 15:35:41,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:35:41 BoogieIcfgContainer [2022-12-14 15:35:41,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:35:41,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:35:41,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:35:41,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:35:41,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:35:41" (1/3) ... [2022-12-14 15:35:41,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435faf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:35:41, skipping insertion in model container [2022-12-14 15:35:41,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:35:41" (2/3) ... [2022-12-14 15:35:41,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435faf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:35:41, skipping insertion in model container [2022-12-14 15:35:41,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:35:41" (3/3) ... [2022-12-14 15:35:41,462 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2022-12-14 15:35:41,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:35:41,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 15:35:41,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:35:41,519 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;@1236a8d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:35:41,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 15:35:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 15:35:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:35:41,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:41,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:41,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2022-12-14 15:35:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:41,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668279117] [2022-12-14 15:35:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:41,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:41,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668279117] [2022-12-14 15:35:41,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668279117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:35:41,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:35:41,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:35:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454512801] [2022-12-14 15:35:41,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:35:41,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:35:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:35:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:35:41,743 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-12-14 15:35:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:41,823 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-12-14 15:35:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:35:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-12-14 15:35:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:41,833 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:35:41,834 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 15:35:41,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:35:41,838 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:41,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:35:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 15:35:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 15:35:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 15:35:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-14 15:35:41,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-12-14 15:35:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:41,864 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-14 15:35:41,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-12-14 15:35:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-14 15:35:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:35:41,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:41,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:41,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:35:41,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2022-12-14 15:35:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:41,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339185843] [2022-12-14 15:35:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:41,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:41,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339185843] [2022-12-14 15:35:41,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339185843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:35:41,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:35:41,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:35:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68171420] [2022-12-14 15:35:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:35:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:35:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:35:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:35:41,928 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:35:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:41,972 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-12-14 15:35:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:35:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 15:35:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:41,973 INFO L225 Difference]: With dead ends: 24 [2022-12-14 15:35:41,973 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 15:35:41,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:35:41,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:41,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:35:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 15:35:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-14 15:35:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 15:35:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-14 15:35:41,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-12-14 15:35:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:41,979 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-14 15:35:41,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:35:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-14 15:35:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:35:41,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:41,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:35:41,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2022-12-14 15:35:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:41,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681981401] [2022-12-14 15:35:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:35:42,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681981401] [2022-12-14 15:35:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681981401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:42,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355343001] [2022-12-14 15:35:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:42,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:42,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:42,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:42,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:35:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:42,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:35:42,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:35:42,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 15:35:42,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355343001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [568521500] [2022-12-14 15:35:42,383 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:42,383 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:42,387 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:337) 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-12-14 15:35:42,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-12-14 15:35:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313154690] [2022-12-14 15:35:42,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:42,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:35:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:35:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:35:42,390 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 15:35:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:42,490 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-12-14 15:35:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:35:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-12-14 15:35:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:42,491 INFO L225 Difference]: With dead ends: 42 [2022-12-14 15:35:42,491 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 15:35:42,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:35:42,493 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:42,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:35:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 15:35:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 15:35:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-14 15:35:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-12-14 15:35:42,500 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2022-12-14 15:35:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:42,500 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-12-14 15:35:42,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 15:35:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-12-14 15:35:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 15:35:42,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:42,503 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:42,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:35:42,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:42,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -801544853, now seen corresponding path program 1 times [2022-12-14 15:35:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:42,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522201123] [2022-12-14 15:35:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-14 15:35:42,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522201123] [2022-12-14 15:35:42,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522201123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975248649] [2022-12-14 15:35:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:42,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:42,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:42,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:35:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:43,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:35:43,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-14 15:35:43,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-14 15:35:43,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975248649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:43,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790450458] [2022-12-14 15:35:43,364 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:43,364 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:43,365 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:337) 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-12-14 15:35:43,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:43,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-12-14 15:35:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869398439] [2022-12-14 15:35:43,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:35:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:35:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:35:43,367 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-12-14 15:35:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:43,471 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2022-12-14 15:35:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:35:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 64 [2022-12-14 15:35:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:43,473 INFO L225 Difference]: With dead ends: 44 [2022-12-14 15:35:43,473 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 15:35:43,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:35:43,474 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:43,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:35:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 15:35:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-14 15:35:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2022-12-14 15:35:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2022-12-14 15:35:43,481 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 64 [2022-12-14 15:35:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:43,482 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. [2022-12-14 15:35:43,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-12-14 15:35:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2022-12-14 15:35:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 15:35:43,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:43,485 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:43,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:35:43,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:43,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1908799154, now seen corresponding path program 2 times [2022-12-14 15:35:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:43,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030163128] [2022-12-14 15:35:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2022-12-14 15:35:43,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030163128] [2022-12-14 15:35:43,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030163128] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268704416] [2022-12-14 15:35:43,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:35:43,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:43,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:44,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:35:44,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 15:35:44,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:44,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:35:44,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2022-12-14 15:35:44,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 14 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-12-14 15:35:44,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268704416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:44,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310187258] [2022-12-14 15:35:44,566 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:44,566 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:44,566 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:337) 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-12-14 15:35:44,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:44,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-12-14 15:35:44,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214841053] [2022-12-14 15:35:44,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:44,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:35:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:35:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:35:44,568 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-12-14 15:35:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:44,858 INFO L93 Difference]: Finished difference Result 87 states and 174 transitions. [2022-12-14 15:35:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:35:44,858 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Word has length 157 [2022-12-14 15:35:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:44,860 INFO L225 Difference]: With dead ends: 87 [2022-12-14 15:35:44,860 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 15:35:44,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:35:44,863 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 73 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:44,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 95 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:35:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 15:35:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 15:35:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-12-14 15:35:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-12-14 15:35:44,873 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 157 [2022-12-14 15:35:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:44,874 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-12-14 15:35:44,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 10 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-12-14 15:35:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-12-14 15:35:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 15:35:44,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:44,878 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:44,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:35:45,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:45,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -982934650, now seen corresponding path program 3 times [2022-12-14 15:35:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:45,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364370791] [2022-12-14 15:35:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2022-12-14 15:35:45,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364370791] [2022-12-14 15:35:45,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364370791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424576645] [2022-12-14 15:35:45,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:35:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:45,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:45,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:35:45,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:35:45,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:45,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 15:35:45,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 843 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2022-12-14 15:35:45,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 891 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2022-12-14 15:35:47,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424576645] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [317878778] [2022-12-14 15:35:47,152 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:47,153 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:47,153 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:337) 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-12-14 15:35:47,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:47,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2022-12-14 15:35:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288020032] [2022-12-14 15:35:47,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:47,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 15:35:47,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 15:35:47,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:35:47,156 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2022-12-14 15:35:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:47,565 INFO L93 Difference]: Finished difference Result 134 states and 225 transitions. [2022-12-14 15:35:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:35:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) Word has length 215 [2022-12-14 15:35:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:47,568 INFO L225 Difference]: With dead ends: 134 [2022-12-14 15:35:47,568 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 15:35:47,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 407 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 15:35:47,571 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 126 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:47,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 160 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:35:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 15:35:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-12-14 15:35:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 53 states have internal predecessors, (59), 13 states have call successors, (13), 11 states have call predecessors, (13), 8 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2022-12-14 15:35:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2022-12-14 15:35:47,584 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 215 [2022-12-14 15:35:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:47,585 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2022-12-14 15:35:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2022-12-14 15:35:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2022-12-14 15:35:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-14 15:35:47,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:47,590 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:47,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:35:47,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 15:35:47,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash 953177853, now seen corresponding path program 4 times [2022-12-14 15:35:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:47,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598595611] [2022-12-14 15:35:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-12-14 15:35:48,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598595611] [2022-12-14 15:35:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598595611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180322371] [2022-12-14 15:35:48,076 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:35:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:48,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:48,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:35:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:48,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 15:35:48,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-12-14 15:35:48,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2022-12-14 15:35:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180322371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953824183] [2022-12-14 15:35:49,525 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:49,525 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:49,525 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:337) 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-12-14 15:35:49,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:49,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-12-14 15:35:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380529526] [2022-12-14 15:35:49,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:49,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 15:35:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 15:35:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:35:49,527 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2022-12-14 15:35:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:49,717 INFO L93 Difference]: Finished difference Result 94 states and 138 transitions. [2022-12-14 15:35:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:35:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) Word has length 283 [2022-12-14 15:35:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:49,720 INFO L225 Difference]: With dead ends: 94 [2022-12-14 15:35:49,720 INFO L226 Difference]: Without dead ends: 88 [2022-12-14 15:35:49,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 557 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:35:49,722 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 120 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:49,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 83 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:35:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-14 15:35:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-12-14 15:35:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 59 states have internal predecessors, (65), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (51), 17 states have call predecessors, (51), 15 states have call successors, (51) [2022-12-14 15:35:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2022-12-14 15:35:49,736 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 283 [2022-12-14 15:35:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:49,737 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2022-12-14 15:35:49,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2022-12-14 15:35:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2022-12-14 15:35:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2022-12-14 15:35:49,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:49,764 INFO L195 NwaCegarLoop]: trace histogram [151, 151, 122, 75, 75, 75, 75, 75, 75, 75, 47, 29, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:49,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:35:49,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 15:35:49,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2044230752, now seen corresponding path program 5 times [2022-12-14 15:35:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103811152] [2022-12-14 15:35:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 1726 proven. 7674 refuted. 0 times theorem prover too weak. 54381 trivial. 0 not checked. [2022-12-14 15:35:51,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103811152] [2022-12-14 15:35:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103811152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285865012] [2022-12-14 15:35:51,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:35:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:51,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:51,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:35:51,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2022-12-14 15:35:51,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:51,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:35:51,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 11882 proven. 123 refuted. 0 times theorem prover too weak. 51776 trivial. 0 not checked. [2022-12-14 15:35:51,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 4991 proven. 390 refuted. 0 times theorem prover too weak. 58400 trivial. 0 not checked. [2022-12-14 15:35:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285865012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [242672070] [2022-12-14 15:35:53,728 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:35:53,728 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:53,728 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:337) 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-12-14 15:35:53,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:53,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 13] total 26 [2022-12-14 15:35:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744980716] [2022-12-14 15:35:53,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:35:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:35:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:35:53,731 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 17 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (40), 20 states have call predecessors, (40), 17 states have call successors, (40) [2022-12-14 15:35:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:54,255 INFO L93 Difference]: Finished difference Result 194 states and 353 transitions. [2022-12-14 15:35:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 15:35:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 17 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (40), 20 states have call predecessors, (40), 17 states have call successors, (40) Word has length 1032 [2022-12-14 15:35:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:54,257 INFO L225 Difference]: With dead ends: 194 [2022-12-14 15:35:54,257 INFO L226 Difference]: Without dead ends: 111 [2022-12-14 15:35:54,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2113 GetRequests, 2057 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=615, Invalid=2037, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 15:35:54,259 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 186 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:54,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 150 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:35:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-14 15:35:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2022-12-14 15:35:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 68 states have internal predecessors, (74), 18 states have call successors, (18), 14 states have call predecessors, (18), 10 states have return successors, (53), 17 states have call predecessors, (53), 18 states have call successors, (53) [2022-12-14 15:35:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-12-14 15:35:54,268 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 1032 [2022-12-14 15:35:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:54,268 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-12-14 15:35:54,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 17 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (40), 20 states have call predecessors, (40), 17 states have call successors, (40) [2022-12-14 15:35:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-12-14 15:35:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2022-12-14 15:35:54,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:54,275 INFO L195 NwaCegarLoop]: trace histogram [159, 159, 128, 79, 79, 79, 79, 79, 79, 79, 49, 31, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:54,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:35:54,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:54,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:35:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash 872191932, now seen corresponding path program 6 times [2022-12-14 15:35:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:54,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136532865] [2022-12-14 15:35:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 2537 proven. 8526 refuted. 0 times theorem prover too weak. 59633 trivial. 0 not checked. [2022-12-14 15:35:56,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136532865] [2022-12-14 15:35:56,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136532865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845634672] [2022-12-14 15:35:56,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:35:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:56,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:56,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:35:56,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:35:56,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:56,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 15:35:56,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 36038 proven. 4673 refuted. 0 times theorem prover too weak. 29985 trivial. 0 not checked. [2022-12-14 15:35:56,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 2891 proven. 9861 refuted. 0 times theorem prover too weak. 57944 trivial. 0 not checked. [2022-12-14 15:36:00,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845634672] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:36:00,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474670924] [2022-12-14 15:36:00,533 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:36:00,533 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:36:00,533 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:337) 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-12-14 15:36:00,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:36:00,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2022-12-14 15:36:00,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169614251] [2022-12-14 15:36:00,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:00,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:36:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:00,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:36:00,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:36:00,536 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 36 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 31 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (51), 18 states have call predecessors, (51), 31 states have call successors, (51) [2022-12-14 15:36:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:01,318 INFO L93 Difference]: Finished difference Result 222 states and 387 transitions. [2022-12-14 15:36:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 15:36:01,319 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 31 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (51), 18 states have call predecessors, (51), 31 states have call successors, (51) Word has length 1086 [2022-12-14 15:36:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:01,321 INFO L225 Difference]: With dead ends: 222 [2022-12-14 15:36:01,321 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 15:36:01,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2230 GetRequests, 2150 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1076, Invalid=3346, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 15:36:01,323 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 227 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:01,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 186 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:36:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 15:36:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2022-12-14 15:36:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.0375) internal successors, (83), 77 states have internal predecessors, (83), 21 states have call successors, (21), 17 states have call predecessors, (21), 10 states have return successors, (56), 17 states have call predecessors, (56), 21 states have call successors, (56) [2022-12-14 15:36:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2022-12-14 15:36:01,332 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 1086 [2022-12-14 15:36:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:01,333 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2022-12-14 15:36:01,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 31 states have call successors, (38), 2 states have call predecessors, (38), 16 states have return successors, (51), 18 states have call predecessors, (51), 31 states have call successors, (51) [2022-12-14 15:36:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2022-12-14 15:36:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-12-14 15:36:01,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:01,345 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:01,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:36:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:01,546 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:36:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -600231419, now seen corresponding path program 7 times [2022-12-14 15:36:01,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:01,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183684643] [2022-12-14 15:36:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 2756 proven. 10117 refuted. 0 times theorem prover too weak. 20223 trivial. 0 not checked. [2022-12-14 15:36:11,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:11,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183684643] [2022-12-14 15:36:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183684643] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15668146] [2022-12-14 15:36:11,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:36:11,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:11,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:11,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:11,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:36:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:12,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2022-12-14 15:36:12,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-12-14 15:36:12,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:37:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-12-14 15:37:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15668146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:37:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231520593] [2022-12-14 15:37:18,324 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:37:18,324 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:37:18,324 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:337) 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-12-14 15:37:18,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:37:18,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 41 [2022-12-14 15:37:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073895589] [2022-12-14 15:37:18,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:37:18,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 15:37:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:18,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 15:37:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 15:37:18,327 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-12-14 15:37:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:18,515 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2022-12-14 15:37:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:37:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) Word has length 746 [2022-12-14 15:37:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:18,516 INFO L225 Difference]: With dead ends: 119 [2022-12-14 15:37:18,517 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 15:37:18,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1716 GetRequests, 1488 SyntacticMatches, 184 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5463 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 15:37:18,518 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:18,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:37:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 15:37:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 15:37:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 15:37:18,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2022-12-14 15:37:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:18,519 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 15:37:18,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-12-14 15:37:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 15:37:18,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 15:37:18,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 15:37:18,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:37:18,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 15:37:18,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 15:37:19,097 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-12-14 15:37:19,097 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 |fibonacci_#in~n|) (<= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| fibonacci_~n)) [2022-12-14 15:37:19,097 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (= |fibonacci_#t~ret4| 1))) (and (or (not (<= |fibonacci_#in~n| 2)) (and .cse0 (< 1 fibonacci_~n) .cse1)) (or (and (<= 2 |fibonacci_#t~ret4|) .cse0 (<= 4 |fibonacci_#in~n|) (<= |fibonacci_#in~n| fibonacci_~n)) (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| 3)) (not (<= 3 |fibonacci_#in~n|))) (or (<= 21 |fibonacci_#t~ret4|) (and (<= 5 |fibonacci_#t~ret4|) (<= fibonacci_~n 6)) (and (<= 3 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 5)) (and (<= 8 |fibonacci_#t~ret4|) (<= fibonacci_~n 7)) (not (<= 5 |fibonacci_#in~n|)) (and (< |fibonacci_#in~n| 9) (<= 13 |fibonacci_#t~ret4|))))) [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 15:37:19,098 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-12-14 15:37:19,101 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-12-14 15:37:19,102 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:37:19,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:37:19 BoogieIcfgContainer [2022-12-14 15:37:19,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:37:19,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:37:19,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:37:19,108 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:37:19,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:35:41" (3/4) ... [2022-12-14 15:37:19,110 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 15:37:19,114 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-12-14 15:37:19,116 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-12-14 15:37:19,116 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 15:37:19,116 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 15:37:19,116 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 15:37:19,134 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:37:19,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:37:19,135 INFO L158 Benchmark]: Toolchain (without parser) took 98112.03ms. Allocated memory was 136.3MB in the beginning and 633.3MB in the end (delta: 497.0MB). Free memory was 101.0MB in the beginning and 414.6MB in the end (delta: -313.6MB). Peak memory consumption was 187.6MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,135 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:37:19,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.10ms. Allocated memory is still 136.3MB. Free memory was 100.6MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.95ms. Allocated memory is still 136.3MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,136 INFO L158 Benchmark]: Boogie Preprocessor took 14.49ms. Allocated memory is still 136.3MB. Free memory was 89.2MB in the beginning and 88.4MB in the end (delta: 803.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:37:19,136 INFO L158 Benchmark]: RCFGBuilder took 214.40ms. Allocated memory is still 136.3MB. Free memory was 88.4MB in the beginning and 78.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,136 INFO L158 Benchmark]: TraceAbstraction took 97650.32ms. Allocated memory was 136.3MB in the beginning and 633.3MB in the end (delta: 497.0MB). Free memory was 77.5MB in the beginning and 417.7MB in the end (delta: -340.2MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,136 INFO L158 Benchmark]: Witness Printer took 27.04ms. Allocated memory is still 633.3MB. Free memory was 417.7MB in the beginning and 414.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:37:19,137 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.18ms. Allocated memory is still 136.3MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.10ms. Allocated memory is still 136.3MB. Free memory was 100.6MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.95ms. Allocated memory is still 136.3MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.49ms. Allocated memory is still 136.3MB. Free memory was 89.2MB in the beginning and 88.4MB in the end (delta: 803.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 214.40ms. Allocated memory is still 136.3MB. Free memory was 88.4MB in the beginning and 78.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 97650.32ms. Allocated memory was 136.3MB in the beginning and 633.3MB in the end (delta: 497.0MB). Free memory was 77.5MB in the beginning and 417.7MB in the end (delta: -340.2MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Witness Printer took 27.04ms. Allocated memory is still 633.3MB. Free memory was 417.7MB in the beginning and 414.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 97.6s, OverallIterations: 10, TraceHistogramMax: 159, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 1140 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 1457 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2352 IncrementalHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1457 mSolverCounterUnsat, 215 mSDtfsCounter, 2352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7663 GetRequests, 7135 SyntacticMatches, 229 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=9, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 206 PreInvPairs, 293 NumberOfFragments, 96 HoareAnnotationTreeSize, 206 FomulaSimplifications, 846 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2494 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 90.5s InterpolantComputationTime, 7233 NumberOfCodeBlocks, 6136 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 10813 ConstructedInterpolants, 0 QuantifiedInterpolants, 16160 SizeOfPredicates, 44 NumberOfNonLiveVariables, 5572 ConjunctsInSsa, 322 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 470948/528759 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 15:37:19,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1b05aba-7032-4942-a273-65b24d2cb76c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE