./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 b5237d83 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_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 00:24:14,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:24:14,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:24:14,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:24:14,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:24:14,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:24:14,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:24:14,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:24:14,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:24:14,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:24:14,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:24:14,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:24:14,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:24:14,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:24:14,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:24:14,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:24:14,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:24:14,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:24:14,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:24:14,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:24:14,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:24:14,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:24:14,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:24:14,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:24:14,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:24:14,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:24:14,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:24:14,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:24:14,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:24:14,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:24:14,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:24:14,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:24:14,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:24:14,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:24:14,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:24:14,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:24:14,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:24:14,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:24:14,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:24:14,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:24:14,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:24:14,999 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:24:15,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:24:15,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:24:15,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:24:15,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:24:15,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:24:15,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:24:15,040 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:24:15,040 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:24:15,040 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:24:15,040 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:24:15,041 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:24:15,042 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:24:15,042 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:24:15,042 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:24:15,042 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:24:15,042 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:24:15,043 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:24:15,043 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:24:15,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:24:15,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:24:15,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:24:15,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:24:15,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:24:15,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:24:15,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:24:15,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:24:15,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:24:15,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:24:15,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:24:15,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:24:15,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:24:15,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:24:15,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:24:15,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:24:15,047 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:24:15,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:24:15,049 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_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/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_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba 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-11-22 00:24:15,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:24:15,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:24:15,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:24:15,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:24:15,390 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:24:15,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/recursive/Fibonacci03.c [2022-11-22 00:24:18,325 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:24:18,596 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:24:18,597 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/sv-benchmarks/c/recursive/Fibonacci03.c [2022-11-22 00:24:18,603 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/data/b093dec2e/9d9a9047d4a6493abb891c8f3c4e2bd6/FLAGe6aa71f68 [2022-11-22 00:24:18,624 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/data/b093dec2e/9d9a9047d4a6493abb891c8f3c4e2bd6 [2022-11-22 00:24:18,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:24:18,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:24:18,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:24:18,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:24:18,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:24:18,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ec3032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18, skipping insertion in model container [2022-11-22 00:24:18,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:24:18,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:24:18,853 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_ea040145-b7f0-477f-948f-8cf6c945eb08/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-11-22 00:24:18,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:24:18,869 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:24:18,887 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_ea040145-b7f0-477f-948f-8cf6c945eb08/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-11-22 00:24:18,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:24:18,901 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:24:18,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18 WrapperNode [2022-11-22 00:24:18,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:24:18,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:24:18,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:24:18,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:24:18,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,934 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-11-22 00:24:18,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:24:18,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:24:18,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:24:18,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:24:18,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,963 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:24:18,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:24:18,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:24:18,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:24:18,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (1/1) ... [2022-11-22 00:24:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:24:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:19,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:24:19,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:24:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-22 00:24:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-22 00:24:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:24:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:24:19,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:24:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:24:19,115 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:24:19,117 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:24:19,226 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:24:19,241 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:24:19,241 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:24:19,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:19 BoogieIcfgContainer [2022-11-22 00:24:19,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:24:19,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:24:19,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:24:19,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:24:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:24:18" (1/3) ... [2022-11-22 00:24:19,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367bf2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:24:19, skipping insertion in model container [2022-11-22 00:24:19,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:24:18" (2/3) ... [2022-11-22 00:24:19,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367bf2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:24:19, skipping insertion in model container [2022-11-22 00:24:19,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:19" (3/3) ... [2022-11-22 00:24:19,253 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2022-11-22 00:24:19,273 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:24:19,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 00:24:19,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:24:19,329 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;@6c3bb201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:24:19,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 00:24:19,334 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-11-22 00:24:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:24:19,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:19,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:19,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2022-11-22 00:24:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:19,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276806229] [2022-11-22 00:24:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:19,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276806229] [2022-11-22 00:24:19,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276806229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:24:19,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:24:19,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:24:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014331559] [2022-11-22 00:24:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:24:19,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:24:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:19,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:24:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:24:19,645 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-11-22 00:24:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:19,826 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-22 00:24:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:24:19,829 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-11-22 00:24:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:19,837 INFO L225 Difference]: With dead ends: 28 [2022-11-22 00:24:19,837 INFO L226 Difference]: Without dead ends: 18 [2022-11-22 00:24:19,840 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-11-22 00:24:19,844 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:19,845 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.1s Time] [2022-11-22 00:24:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-22 00:24:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-22 00:24:19,900 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-11-22 00:24:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-22 00:24:19,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-22 00:24:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:19,908 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-22 00:24:19,908 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-11-22 00:24:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-22 00:24:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:24:19,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:19,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:19,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:24:19,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2022-11-22 00:24:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847167594] [2022-11-22 00:24:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:20,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:20,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847167594] [2022-11-22 00:24:20,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847167594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:24:20,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:24:20,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:24:20,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763478073] [2022-11-22 00:24:20,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:24:20,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:24:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:24:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:24:20,048 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-11-22 00:24:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:20,103 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-22 00:24:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:24:20,104 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-11-22 00:24:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:20,105 INFO L225 Difference]: With dead ends: 24 [2022-11-22 00:24:20,105 INFO L226 Difference]: Without dead ends: 20 [2022-11-22 00:24:20,106 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-11-22 00:24:20,107 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-11-22 00:24:20,108 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-11-22 00:24:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-22 00:24:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-22 00:24:20,121 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-11-22 00:24:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-22 00:24:20,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-22 00:24:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:20,123 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-22 00:24:20,123 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-11-22 00:24:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-22 00:24:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:24:20,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:20,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:20,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:24:20,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2022-11-22 00:24:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349872064] [2022-11-22 00:24:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:24:20,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349872064] [2022-11-22 00:24:20,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349872064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888822342] [2022-11-22 00:24:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:20,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:20,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:24:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:20,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:24:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:24:20,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:24:20,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888822342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:20,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1537410118] [2022-11-22 00:24:20,863 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:20,863 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:20,868 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:20,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:20,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-22 00:24:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224858019] [2022-11-22 00:24:20,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:24:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:24:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:24:20,876 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-11-22 00:24:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:21,080 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-11-22 00:24:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:24:21,081 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-11-22 00:24:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:21,085 INFO L225 Difference]: With dead ends: 42 [2022-11-22 00:24:21,085 INFO L226 Difference]: Without dead ends: 25 [2022-11-22 00:24:21,088 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-11-22 00:24:21,091 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:21,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:24:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-22 00:24:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-22 00:24:21,107 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-11-22 00:24:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-22 00:24:21,112 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2022-11-22 00:24:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:21,113 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-22 00:24:21,114 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-11-22 00:24:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-22 00:24:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-22 00:24:21,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:21,121 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-11-22 00:24:21,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:21,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-22 00:24:21,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -801544853, now seen corresponding path program 1 times [2022-11-22 00:24:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:21,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706656265] [2022-11-22 00:24:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-22 00:24:21,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:21,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706656265] [2022-11-22 00:24:21,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706656265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534722134] [2022-11-22 00:24:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:21,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:21,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:21,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:24:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:21,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 00:24:21,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-22 00:24:21,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-22 00:24:22,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534722134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377603109] [2022-11-22 00:24:22,302 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:22,302 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:22,303 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:22,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:22,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-11-22 00:24:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077881418] [2022-11-22 00:24:22,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:22,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:24:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:24:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:24:22,307 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-11-22 00:24:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:22,474 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2022-11-22 00:24:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:24:22,475 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-11-22 00:24:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:22,480 INFO L225 Difference]: With dead ends: 44 [2022-11-22 00:24:22,481 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 00:24:22,481 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-11-22 00:24:22,485 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:22,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 59 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:24:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 00:24:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-22 00:24:22,507 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-11-22 00:24:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2022-11-22 00:24:22,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 64 [2022-11-22 00:24:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:22,516 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. [2022-11-22 00:24:22,517 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-11-22 00:24:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2022-11-22 00:24:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-22 00:24:22,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:22,528 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 17, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:22,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:22,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:22,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 494319388, now seen corresponding path program 2 times [2022-11-22 00:24:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:22,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932044751] [2022-11-22 00:24:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 86 proven. 486 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2022-11-22 00:24:23,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932044751] [2022-11-22 00:24:23,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932044751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767231569] [2022-11-22 00:24:23,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:24:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:23,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:23,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:24:23,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-22 00:24:23,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:24:23,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 00:24:23,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 603 proven. 12 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-11-22 00:24:23,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 513 proven. 25 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2022-11-22 00:24:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767231569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [478593051] [2022-11-22 00:24:24,252 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:24,252 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:24,252 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:24,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:24,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-11-22 00:24:24,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023456084] [2022-11-22 00:24:24,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:24,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 00:24:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 00:24:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-22 00:24:24,257 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-22 00:24:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:24,731 INFO L93 Difference]: Finished difference Result 87 states and 174 transitions. [2022-11-22 00:24:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:24:24,732 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) Word has length 183 [2022-11-22 00:24:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:24,734 INFO L225 Difference]: With dead ends: 87 [2022-11-22 00:24:24,734 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 00:24:24,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 358 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 00:24:24,737 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 79 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:24,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 91 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:24:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 00:24:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-22 00:24:24,745 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-11-22 00:24:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-11-22 00:24:24,749 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 183 [2022-11-22 00:24:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:24,752 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-11-22 00:24:24,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-22 00:24:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-11-22 00:24:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-22 00:24:24,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:24,765 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:24,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:24,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:24,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1752708135, now seen corresponding path program 3 times [2022-11-22 00:24:24,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:24,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796764522] [2022-11-22 00:24:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2022-11-22 00:24:25,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796764522] [2022-11-22 00:24:25,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796764522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184870959] [2022-11-22 00:24:25,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:24:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:25,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:25,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:24:25,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:24:25,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:24:25,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-22 00:24:25,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 734 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2022-11-22 00:24:25,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 782 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2022-11-22 00:24:28,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184870959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:28,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1268480161] [2022-11-22 00:24:28,230 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:28,230 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:28,230 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:28,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:28,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2022-11-22 00:24:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296122779] [2022-11-22 00:24:28,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:28,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 00:24:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 00:24:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:24:28,235 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-11-22 00:24:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:29,020 INFO L93 Difference]: Finished difference Result 134 states and 225 transitions. [2022-11-22 00:24:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-22 00:24:29,021 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 201 [2022-11-22 00:24:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:29,023 INFO L225 Difference]: With dead ends: 134 [2022-11-22 00:24:29,023 INFO L226 Difference]: Without dead ends: 82 [2022-11-22 00:24:29,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 379 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 00:24:29,026 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 341 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:29,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 141 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:24:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-22 00:24:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-11-22 00:24:29,037 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-11-22 00:24:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2022-11-22 00:24:29,039 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 201 [2022-11-22 00:24:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:29,040 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2022-11-22 00:24:29,040 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-11-22 00:24:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2022-11-22 00:24:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-22 00:24:29,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:29,045 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-11-22 00:24:29,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:29,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:29,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash 953177853, now seen corresponding path program 4 times [2022-11-22 00:24:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:29,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082786394] [2022-11-22 00:24:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-22 00:24:29,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082786394] [2022-11-22 00:24:29,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082786394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828577392] [2022-11-22 00:24:29,839 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:24:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:29,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:29,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:29,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:24:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:30,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 00:24:30,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-22 00:24:30,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2022-11-22 00:24:32,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828577392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:32,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884021854] [2022-11-22 00:24:32,417 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:32,418 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:32,418 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:32,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:32,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-11-22 00:24:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922555400] [2022-11-22 00:24:32,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:32,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 00:24:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 00:24:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-11-22 00:24:32,421 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-11-22 00:24:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:32,710 INFO L93 Difference]: Finished difference Result 94 states and 138 transitions. [2022-11-22 00:24:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 00:24:32,711 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-11-22 00:24:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:32,714 INFO L225 Difference]: With dead ends: 94 [2022-11-22 00:24:32,714 INFO L226 Difference]: Without dead ends: 88 [2022-11-22 00:24:32,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 557 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2022-11-22 00:24:32,715 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 132 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:32,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 83 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:24:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-22 00:24:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-22 00:24:32,739 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-11-22 00:24:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2022-11-22 00:24:32,743 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 283 [2022-11-22 00:24:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:32,746 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2022-11-22 00:24:32,746 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-11-22 00:24:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2022-11-22 00:24:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2022-11-22 00:24:32,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:32,802 INFO L195 NwaCegarLoop]: trace histogram [171, 171, 138, 85, 85, 85, 85, 85, 85, 85, 53, 33, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:32,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:33,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash 826976910, now seen corresponding path program 5 times [2022-11-22 00:24:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:33,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635990664] [2022-11-22 00:24:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 1699 proven. 9031 refuted. 0 times theorem prover too weak. 71143 trivial. 0 not checked. [2022-11-22 00:24:36,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:36,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635990664] [2022-11-22 00:24:36,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635990664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:36,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110135024] [2022-11-22 00:24:36,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:24:36,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:36,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:36,217 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:36,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:24:36,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2022-11-22 00:24:36,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:24:36,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-22 00:24:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 19822 proven. 714 refuted. 0 times theorem prover too weak. 61337 trivial. 0 not checked. [2022-11-22 00:24:37,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 6963 proven. 1425 refuted. 0 times theorem prover too weak. 73485 trivial. 0 not checked. [2022-11-22 00:24:41,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110135024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92519218] [2022-11-22 00:24:41,996 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:41,996 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:41,997 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:41,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:41,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 19] total 30 [2022-11-22 00:24:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33129324] [2022-11-22 00:24:41,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:42,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:24:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:24:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-11-22 00:24:42,003 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 21 states have call successors, (33), 2 states have call predecessors, (33), 15 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-22 00:24:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:42,956 INFO L93 Difference]: Finished difference Result 194 states and 353 transitions. [2022-11-22 00:24:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 00:24:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 21 states have call successors, (33), 2 states have call predecessors, (33), 15 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) Word has length 1168 [2022-11-22 00:24:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:42,960 INFO L225 Difference]: With dead ends: 194 [2022-11-22 00:24:42,960 INFO L226 Difference]: Without dead ends: 111 [2022-11-22 00:24:42,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2385 GetRequests, 2322 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=734, Invalid=2346, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 00:24:42,963 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 281 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:42,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 142 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:24:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-22 00:24:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2022-11-22 00:24:42,975 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-11-22 00:24:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-11-22 00:24:42,977 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 1168 [2022-11-22 00:24:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:42,978 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-11-22 00:24:42,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 21 states have call successors, (33), 2 states have call predecessors, (33), 15 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-22 00:24:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-11-22 00:24:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2022-11-22 00:24:42,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:42,987 INFO L195 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:42,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:24:43,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 00:24:43,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash 70108304, now seen corresponding path program 6 times [2022-11-22 00:24:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:43,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868538691] [2022-11-22 00:24:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3397 proven. 6791 refuted. 0 times theorem prover too weak. 40722 trivial. 0 not checked. [2022-11-22 00:24:45,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868538691] [2022-11-22 00:24:45,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868538691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304844590] [2022-11-22 00:24:45,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:24:45,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:45,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:45,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:45,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:24:46,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:24:46,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:24:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 00:24:46,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 4043 proven. 7419 refuted. 0 times theorem prover too weak. 39448 trivial. 0 not checked. [2022-11-22 00:24:46,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 4043 proven. 7566 refuted. 0 times theorem prover too weak. 39301 trivial. 0 not checked. [2022-11-22 00:24:54,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304844590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:24:54,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1175690751] [2022-11-22 00:24:54,426 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:24:54,427 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:24:54,428 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:24:54,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:24:54,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 35] total 40 [2022-11-22 00:24:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308692973] [2022-11-22 00:24:54,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:24:54,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-22 00:24:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:24:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-22 00:24:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2022-11-22 00:24:54,439 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 40 states, 40 states have (on average 3.075) internal successors, (123), 40 states have internal predecessors, (123), 34 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (53), 20 states have call predecessors, (53), 34 states have call successors, (53) [2022-11-22 00:24:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:55,880 INFO L93 Difference]: Finished difference Result 254 states and 493 transitions. [2022-11-22 00:24:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-22 00:24:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.075) internal successors, (123), 40 states have internal predecessors, (123), 34 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (53), 20 states have call predecessors, (53), 34 states have call successors, (53) Word has length 923 [2022-11-22 00:24:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:55,885 INFO L225 Difference]: With dead ends: 254 [2022-11-22 00:24:55,885 INFO L226 Difference]: Without dead ends: 159 [2022-11-22 00:24:55,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1913 GetRequests, 1822 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1360, Invalid=4340, Unknown=0, NotChecked=0, Total=5700 [2022-11-22 00:24:55,889 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 331 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:55,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 208 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:24:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-22 00:24:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2022-11-22 00:24:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 87 states have internal predecessors, (93), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (64), 18 states have call predecessors, (64), 25 states have call successors, (64) [2022-11-22 00:24:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2022-11-22 00:24:55,906 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 923 [2022-11-22 00:24:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:55,908 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2022-11-22 00:24:55,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.075) internal successors, (123), 40 states have internal predecessors, (123), 34 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (53), 20 states have call predecessors, (53), 34 states have call successors, (53) [2022-11-22 00:24:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2022-11-22 00:24:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-11-22 00:24:55,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:55,915 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-11-22 00:24:55,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 00:24:56,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:56,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 00:24:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -600231419, now seen corresponding path program 7 times [2022-11-22 00:24:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744918824] [2022-11-22 00:24:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 2756 proven. 10117 refuted. 0 times theorem prover too weak. 20223 trivial. 0 not checked. [2022-11-22 00:25:08,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:25:08,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744918824] [2022-11-22 00:25:08,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744918824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:25:08,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83295946] [2022-11-22 00:25:08,709 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:25:08,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:25:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:25:08,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:25:08,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:25:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:25:09,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2022-11-22 00:25:09,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:25:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-11-22 00:25:10,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:26:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-11-22 00:26:37,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83295946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:26:37,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1822297362] [2022-11-22 00:26:37,657 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 00:26:37,657 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:26:37,658 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:26:37,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:26:37,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 41 [2022-11-22 00:26:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536352827] [2022-11-22 00:26:37,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:26:37,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-22 00:26:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:26:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-22 00:26:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2022-11-22 00:26:37,662 INFO L87 Difference]: Start difference. First operand 126 states and 182 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-11-22 00:26:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:26:37,948 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2022-11-22 00:26:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 00:26:37,949 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-11-22 00:26:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:26:37,951 INFO L225 Difference]: With dead ends: 127 [2022-11-22 00:26:37,951 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:26:37,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1488 SyntacticMatches, 184 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 00:26:37,953 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:26:37,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 339 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:26:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:26:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:26:37,955 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-11-22 00:26:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:26:37,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2022-11-22 00:26:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:26:37,955 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:26:37,956 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-11-22 00:26:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:26:37,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:26:37,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 00:26:37,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:26:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:26:38,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:26:38,815 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-11-22 00:26:38,815 INFO L902 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-11-22 00:26:38,816 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-11-22 00:26:38,816 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-11-22 00:26:38,816 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (= |fibonacci_#t~ret4| 1)) (.cse0 (<= fibonacci_~n |fibonacci_#in~n|))) (and (or (not (<= |fibonacci_#in~n| 2)) (and .cse0 (< 1 fibonacci_~n) .cse1)) (let ((.cse2 (<= 8 |fibonacci_#in~n|)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n))) (or (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| 3)) (and .cse2 .cse0 (<= |fibonacci_#in~n| 8) (<= 13 |fibonacci_#t~ret4|) .cse3) (and (<= 5 |fibonacci_#in~n|) (<= 3 |fibonacci_#t~ret4|) .cse0 .cse3 (<= |fibonacci_#in~n| 5)) (not (<= 3 |fibonacci_#in~n|)) (and (<= 2 |fibonacci_#t~ret4|) .cse0 (<= 4 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 4) .cse3) (and .cse2 (<= 21 |fibonacci_#t~ret4|) .cse0 .cse3) (and (<= 5 |fibonacci_#t~ret4|) (<= fibonacci_~n 6) (<= 6 |fibonacci_#in~n|) .cse3) (and (<= 8 |fibonacci_#t~ret4|) (<= fibonacci_~n 7) (<= 7 |fibonacci_#in~n|) .cse3))))) [2022-11-22 00:26:38,816 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-11-22 00:26:38,816 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-11-22 00:26:38,816 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-11-22 00:26:38,816 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-11-22 00:26:38,817 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-11-22 00:26:38,820 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-22 00:26:38,823 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:26:38,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:26:38 BoogieIcfgContainer [2022-11-22 00:26:38,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:26:38,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:26:38,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:26:38,837 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:26:38,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:24:19" (3/4) ... [2022-11-22 00:26:38,840 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:26:38,847 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-11-22 00:26:38,853 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-22 00:26:38,853 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-22 00:26:38,853 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 00:26:38,853 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:26:38,890 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:26:38,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:26:38,891 INFO L158 Benchmark]: Toolchain (without parser) took 140261.65ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 143.9MB in the beginning and 1.1GB in the end (delta: -980.2MB). Peak memory consumption was 390.0MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,891 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:26:38,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.77ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 134.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.49ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,892 INFO L158 Benchmark]: Boogie Preprocessor took 37.84ms. Allocated memory is still 178.3MB. Free memory was 132.4MB in the beginning and 131.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:26:38,892 INFO L158 Benchmark]: RCFGBuilder took 270.26ms. Allocated memory is still 178.3MB. Free memory was 131.2MB in the beginning and 120.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,894 INFO L158 Benchmark]: TraceAbstraction took 139589.42ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 120.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 360.6MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,894 INFO L158 Benchmark]: Witness Printer took 53.61ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:26:38,897 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.23ms. Allocated memory is still 125.8MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.77ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 134.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.49ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.84ms. Allocated memory is still 178.3MB. Free memory was 132.4MB in the beginning and 131.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.26ms. Allocated memory is still 178.3MB. Free memory was 131.2MB in the beginning and 120.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 139589.42ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 120.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 360.6MB. Max. memory is 16.1GB. * Witness Printer took 53.61ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 139.5s, OverallIterations: 10, TraceHistogramMax: 171, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1257 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1217 mSDsluCounter, 1174 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 1702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2390 IncrementalHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1702 mSolverCounterUnsat, 220 mSDtfsCounter, 2390 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7640 GetRequests, 7096 SyntacticMatches, 234 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8592 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=9, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 215 PreInvPairs, 310 NumberOfFragments, 134 HoareAnnotationTreeSize, 215 FomulaSimplifications, 1159 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2967 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 128.6s InterpolantComputationTime, 7203 NumberOfCodeBlocks, 6275 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 10768 ConstructedInterpolants, 0 QuantifiedInterpolants, 16376 SizeOfPredicates, 50 NumberOfNonLiveVariables, 5936 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 464880/524205 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-11-22 00:26:38,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea040145-b7f0-477f-948f-8cf6c945eb08/bin/utaipan-g80aRyZoba/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