./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:53:40,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:53:40,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:53:40,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:53:40,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:53:40,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:53:40,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:53:40,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:53:40,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:53:40,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:53:40,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:53:40,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:53:40,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:53:40,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:53:40,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:53:40,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:53:40,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:53:40,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:53:40,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:53:40,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:53:40,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:53:40,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:53:40,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:53:40,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:53:40,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:53:40,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:53:40,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:53:40,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:53:40,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:53:40,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:53:40,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:53:40,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:53:40,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:53:40,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:53:40,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:53:40,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:53:40,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:53:40,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:53:40,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:53:40,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:53:40,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:53:40,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:53:40,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:53:40,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:53:40,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:53:40,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:53:40,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:53:40,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:53:40,697 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:53:40,697 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:53:40,698 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:53:40,698 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:53:40,699 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:53:40,699 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:53:40,699 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:53:40,700 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:53:40,700 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:53:40,700 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:53:40,700 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:53:40,701 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:53:40,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:53:40,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:53:40,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:53:40,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:53:40,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:53:40,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:53:40,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:53:40,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:53:40,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:53:40,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:53:40,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:53:40,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:53:40,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:53:40,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:53:40,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:40,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:53:40,707 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:53:40,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:53:40,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:53:40,708 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:53:40,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:53:40,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:53:40,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:53:40,709 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_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a6546395432109233bf3e1991428a566548dd822bb23ca198622322bf4db5a8a [2022-11-03 01:53:40,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:53:41,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:53:41,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:53:41,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:53:41,053 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:53:41,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2022-11-03 01:53:41,137 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/data/b0239776f/b97b4247a5d7477b8416237ec4e02778/FLAG54cc64dca [2022-11-03 01:53:41,650 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:53:41,650 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2022-11-03 01:53:41,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/data/b0239776f/b97b4247a5d7477b8416237ec4e02778/FLAG54cc64dca [2022-11-03 01:53:42,010 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/data/b0239776f/b97b4247a5d7477b8416237ec4e02778 [2022-11-03 01:53:42,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:53:42,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:53:42,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:42,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:53:42,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:53:42,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9ea0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42, skipping insertion in model container [2022-11-03 01:53:42,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:53:42,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:53:42,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2022-11-03 01:53:42,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:42,267 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:53:42,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2022-11-03 01:53:42,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:42,295 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:53:42,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42 WrapperNode [2022-11-03 01:53:42,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:42,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:42,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:53:42,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:53:42,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,328 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-03 01:53:42,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:42,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:53:42,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:53:42,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:53:42,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:53:42,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:53:42,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:53:42,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:53:42,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (1/1) ... [2022-11-03 01:53:42,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:42,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:42,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:53:42,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:53:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:53:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:53:42,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:53:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:53:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-11-03 01:53:42,432 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-11-03 01:53:42,503 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:53:42,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:53:42,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:53:42,689 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:53:42,692 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:53:42,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:42 BoogieIcfgContainer [2022-11-03 01:53:42,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:53:42,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:53:42,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:53:42,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:53:42,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:53:42" (1/3) ... [2022-11-03 01:53:42,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a69b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:42, skipping insertion in model container [2022-11-03 01:53:42,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:42" (2/3) ... [2022-11-03 01:53:42,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748a69b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:42, skipping insertion in model container [2022-11-03 01:53:42,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:42" (3/3) ... [2022-11-03 01:53:42,707 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-2.c [2022-11-03 01:53:42,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:53:42,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:53:42,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:53:42,810 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;@fea206a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:53:42,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:53:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:53:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:53:42,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:42,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:42,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1688587911, now seen corresponding path program 1 times [2022-11-03 01:53:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754499872] [2022-11-03 01:53:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:43,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754499872] [2022-11-03 01:53:43,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754499872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:43,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:43,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986437234] [2022-11-03 01:53:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:43,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:43,217 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:43,297 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-11-03 01:53:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:43,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-11-03 01:53:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:43,309 INFO L225 Difference]: With dead ends: 25 [2022-11-03 01:53:43,309 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 01:53:43,312 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-03 01:53:43,315 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:43,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:53:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 01:53:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 01:53:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:53:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 01:53:43,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2022-11-03 01:53:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:43,372 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 01:53:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 01:53:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:53:43,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:43,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:43,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:53:43,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1521360425, now seen corresponding path program 1 times [2022-11-03 01:53:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:43,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318278570] [2022-11-03 01:53:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:43,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318278570] [2022-11-03 01:53:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318278570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:43,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:43,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:43,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5746279] [2022-11-03 01:53:43,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:43,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:43,461 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:43,511 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-11-03 01:53:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-03 01:53:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:43,512 INFO L225 Difference]: With dead ends: 23 [2022-11-03 01:53:43,513 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 01:53:43,513 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-03 01:53:43,515 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:43,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:53:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 01:53:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-03 01:53:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:53:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 01:53:43,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-11-03 01:53:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:43,525 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 01:53:43,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 01:53:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:53:43,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:43,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:43,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:53:43,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:43,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1124411740, now seen corresponding path program 1 times [2022-11-03 01:53:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:43,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397349178] [2022-11-03 01:53:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:53:43,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397349178] [2022-11-03 01:53:43,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397349178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004581330] [2022-11-03 01:53:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:43,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:43,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:53:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:53:43,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:53:43,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:53:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004581330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [322707514] [2022-11-03 01:53:44,245 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:44,245 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:44,249 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:44,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:44,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-11-03 01:53:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691472507] [2022-11-03 01:53:44,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:44,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:53:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:44,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:53:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:53:44,264 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:53:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:44,431 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-11-03 01:53:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2022-11-03 01:53:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:44,433 INFO L225 Difference]: With dead ends: 34 [2022-11-03 01:53:44,433 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 01:53:44,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:53:44,435 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:44,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 48 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 01:53:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 01:53:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-03 01:53:44,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2022-11-03 01:53:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:44,443 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-03 01:53:44,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:53:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-03 01:53:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:53:44,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:44,444 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:44,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:44,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:44,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash 992661418, now seen corresponding path program 1 times [2022-11-03 01:53:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:44,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150639247] [2022-11-03 01:53:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 01:53:44,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150639247] [2022-11-03 01:53:44,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150639247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719911517] [2022-11-03 01:53:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:44,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:44,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:53:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:44,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:53:44,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 01:53:44,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:53:45,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719911517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340264771] [2022-11-03 01:53:45,052 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:45,053 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:45,053 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:45,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:45,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2022-11-03 01:53:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141212697] [2022-11-03 01:53:45,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:45,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:53:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:45,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:53:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:53:45,057 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:53:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:45,126 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-11-03 01:53:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2022-11-03 01:53:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:45,128 INFO L225 Difference]: With dead ends: 28 [2022-11-03 01:53:45,129 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 01:53:45,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:53:45,130 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:45,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:53:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 01:53:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 01:53:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 01:53:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-03 01:53:45,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2022-11-03 01:53:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-03 01:53:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:53:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-03 01:53:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:53:45,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:45,141 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:45,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 01:53:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:45,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1950959585, now seen corresponding path program 2 times [2022-11-03 01:53:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105616655] [2022-11-03 01:53:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:53:45,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:45,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105616655] [2022-11-03 01:53:45,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105616655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:45,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313118319] [2022-11-03 01:53:45,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:53:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:45,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:45,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:53:45,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:53:45,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:45,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:53:45,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:53:45,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:53:45,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313118319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035297053] [2022-11-03 01:53:45,948 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:45,948 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:45,948 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:45,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:45,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2022-11-03 01:53:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4820937] [2022-11-03 01:53:45,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:45,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:53:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:53:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:53:45,951 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-03 01:53:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:46,211 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-11-03 01:53:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:53:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 36 [2022-11-03 01:53:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:46,216 INFO L225 Difference]: With dead ends: 55 [2022-11-03 01:53:46,216 INFO L226 Difference]: Without dead ends: 33 [2022-11-03 01:53:46,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:53:46,218 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:46,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 60 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-03 01:53:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-11-03 01:53:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-03 01:53:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-03 01:53:46,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2022-11-03 01:53:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:46,227 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-03 01:53:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-03 01:53:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-03 01:53:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 01:53:46,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:46,229 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:46,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:46,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:46,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1865467761, now seen corresponding path program 3 times [2022-11-03 01:53:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:46,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656772984] [2022-11-03 01:53:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:53:46,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:46,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656772984] [2022-11-03 01:53:46,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656772984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:46,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395543590] [2022-11-03 01:53:46,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:46,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:46,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:46,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:53:46,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:46,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:46,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:53:46,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:53:46,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:53:47,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395543590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [750560310] [2022-11-03 01:53:47,166 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:47,167 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:47,168 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:47,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2022-11-03 01:53:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312424130] [2022-11-03 01:53:47,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:47,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:53:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:53:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:53:47,174 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 01:53:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:47,297 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-11-03 01:53:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:53:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2022-11-03 01:53:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:47,303 INFO L225 Difference]: With dead ends: 36 [2022-11-03 01:53:47,303 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 01:53:47,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:53:47,307 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:47,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 36 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 01:53:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-03 01:53:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-03 01:53:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-11-03 01:53:47,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2022-11-03 01:53:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:47,327 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2022-11-03 01:53:47,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-03 01:53:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2022-11-03 01:53:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-03 01:53:47,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:47,329 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:47,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:47,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 01:53:47,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1351422375, now seen corresponding path program 4 times [2022-11-03 01:53:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:47,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969855228] [2022-11-03 01:53:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-03 01:53:47,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:47,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969855228] [2022-11-03 01:53:47,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969855228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833179801] [2022-11-03 01:53:47,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:53:47,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:47,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:47,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:47,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:53:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:47,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:53:47,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-03 01:53:47,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-03 01:53:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833179801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362879202] [2022-11-03 01:53:48,589 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:48,589 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:48,589 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:48,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:48,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2022-11-03 01:53:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184130446] [2022-11-03 01:53:48,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:53:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:53:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:53:48,592 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 01:53:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:48,728 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2022-11-03 01:53:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 64 [2022-11-03 01:53:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:48,734 INFO L225 Difference]: With dead ends: 41 [2022-11-03 01:53:48,734 INFO L226 Difference]: Without dead ends: 37 [2022-11-03 01:53:48,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:53:48,736 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:48,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 41 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-03 01:53:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-03 01:53:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2022-11-03 01:53:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2022-11-03 01:53:48,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2022-11-03 01:53:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:48,745 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2022-11-03 01:53:48,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-03 01:53:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2022-11-03 01:53:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-11-03 01:53:48,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:48,752 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:48,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 01:53:48,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:53:48,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1437906103, now seen corresponding path program 5 times [2022-11-03 01:53:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39580027] [2022-11-03 01:53:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2022-11-03 01:53:49,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39580027] [2022-11-03 01:53:49,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39580027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:49,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010150351] [2022-11-03 01:53:49,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:53:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:49,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:49,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:49,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:53:49,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-03 01:53:49,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:49,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:53:49,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2022-11-03 01:53:49,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2022-11-03 01:53:50,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010150351] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:50,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945845527] [2022-11-03 01:53:50,485 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:50,485 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:50,485 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:50,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:50,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-11-03 01:53:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620471094] [2022-11-03 01:53:50,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:50,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:53:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:53:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:53:50,491 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-03 01:53:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:50,908 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2022-11-03 01:53:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:53:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 202 [2022-11-03 01:53:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:50,912 INFO L225 Difference]: With dead ends: 94 [2022-11-03 01:53:50,912 INFO L226 Difference]: Without dead ends: 58 [2022-11-03 01:53:50,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 397 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:53:50,914 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:50,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 85 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-03 01:53:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-03 01:53:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-03 01:53:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2022-11-03 01:53:50,931 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 202 [2022-11-03 01:53:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:50,933 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-11-03 01:53:50,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-03 01:53:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2022-11-03 01:53:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-03 01:53:50,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:50,947 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:50,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:51,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:51,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1858393177, now seen corresponding path program 6 times [2022-11-03 01:53:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444930323] [2022-11-03 01:53:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-03 01:53:51,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:51,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444930323] [2022-11-03 01:53:51,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444930323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:51,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179773603] [2022-11-03 01:53:51,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:51,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:51,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:51,578 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:51,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:53:51,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:51,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:51,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:53:51,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-03 01:53:51,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2022-11-03 01:53:53,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179773603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:53,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [282800618] [2022-11-03 01:53:53,218 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:53,219 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:53,219 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:53,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:53,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2022-11-03 01:53:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371584029] [2022-11-03 01:53:53,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:53,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:53:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:53:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:53:53,223 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-03 01:53:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:53,413 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2022-11-03 01:53:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:53:53,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 173 [2022-11-03 01:53:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:53,416 INFO L225 Difference]: With dead ends: 67 [2022-11-03 01:53:53,416 INFO L226 Difference]: Without dead ends: 63 [2022-11-03 01:53:53,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 338 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:53:53,417 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 107 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:53,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 50 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-03 01:53:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-03 01:53:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-03 01:53:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2022-11-03 01:53:53,428 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2022-11-03 01:53:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:53,428 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2022-11-03 01:53:53,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-03 01:53:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2022-11-03 01:53:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-11-03 01:53:53,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:53,433 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:53,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:53,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:53,648 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1234663993, now seen corresponding path program 7 times [2022-11-03 01:53:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:53,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575438544] [2022-11-03 01:53:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 01:53:54,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:54,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575438544] [2022-11-03 01:53:54,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575438544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:54,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394492278] [2022-11-03 01:53:54,220 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:53:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:54,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:54,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:53:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:54,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:53:54,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 01:53:54,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2022-11-03 01:53:56,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394492278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:56,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1500636739] [2022-11-03 01:53:56,658 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:53:56,658 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:56,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-03 01:53:56,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2022-11-03 01:53:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710350886] [2022-11-03 01:53:56,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:56,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:53:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:53:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:53:56,665 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-03 01:53:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:56,971 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2022-11-03 01:53:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:53:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 282 [2022-11-03 01:53:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:56,975 INFO L225 Difference]: With dead ends: 72 [2022-11-03 01:53:56,975 INFO L226 Difference]: Without dead ends: 68 [2022-11-03 01:53:56,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 555 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2022-11-03 01:53:56,976 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 188 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:56,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 63 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-03 01:53:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-03 01:53:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) [2022-11-03 01:53:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2022-11-03 01:53:56,989 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 282 [2022-11-03 01:53:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:56,990 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2022-11-03 01:53:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-03 01:53:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2022-11-03 01:53:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-11-03 01:53:57,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:57,008 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 71, 44, 44, 44, 44, 44, 44, 44, 27, 18, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:57,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:57,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:53:57,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1790718179, now seen corresponding path program 8 times [2022-11-03 01:53:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:57,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311730406] [2022-11-03 01:53:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 493 proven. 3110 refuted. 0 times theorem prover too weak. 18330 trivial. 0 not checked. [2022-11-03 01:53:58,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311730406] [2022-11-03 01:53:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311730406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:58,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971727427] [2022-11-03 01:53:58,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:53:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:58,629 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:58,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:53:58,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-03 01:53:58,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:58,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:53:58,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 71 refuted. 0 times theorem prover too weak. 19191 trivial. 0 not checked. [2022-11-03 01:53:58,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 77 refuted. 0 times theorem prover too weak. 19185 trivial. 0 not checked. [2022-11-03 01:54:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971727427] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:01,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1448899859] [2022-11-03 01:54:01,189 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:54:01,190 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:01,190 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:54:01,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:01,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 23 [2022-11-03 01:54:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287884531] [2022-11-03 01:54:01,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:01,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:54:01,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:54:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:54:01,196 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-03 01:54:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:01,990 INFO L93 Difference]: Finished difference Result 169 states and 326 transitions. [2022-11-03 01:54:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-03 01:54:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) Word has length 608 [2022-11-03 01:54:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:01,993 INFO L225 Difference]: With dead ends: 169 [2022-11-03 01:54:01,993 INFO L226 Difference]: Without dead ends: 107 [2022-11-03 01:54:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1206 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2022-11-03 01:54:01,996 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 231 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:01,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 93 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:54:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-03 01:54:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-11-03 01:54:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 66 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 10 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2022-11-03 01:54:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2022-11-03 01:54:02,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 608 [2022-11-03 01:54:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:02,009 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2022-11-03 01:54:02,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-03 01:54:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2022-11-03 01:54:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2022-11-03 01:54:02,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:02,043 INFO L195 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:02,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:02,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:54:02,264 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1534963906, now seen corresponding path program 9 times [2022-11-03 01:54:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:02,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622566851] [2022-11-03 01:54:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2022-11-03 01:54:04,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:04,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622566851] [2022-11-03 01:54:04,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622566851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:04,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020172574] [2022-11-03 01:54:04,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:04,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:04,409 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:04,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:54:04,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:04,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:04,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 01:54:04,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7472 refuted. 0 times theorem prover too weak. 39653 trivial. 0 not checked. [2022-11-03 01:54:05,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7619 refuted. 0 times theorem prover too weak. 39506 trivial. 0 not checked. [2022-11-03 01:54:13,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020172574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:13,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201471369] [2022-11-03 01:54:13,013 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:54:13,013 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:13,014 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:54:13,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 35] total 39 [2022-11-03 01:54:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340649330] [2022-11-03 01:54:13,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 01:54:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 01:54:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:54:13,018 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2022-11-03 01:54:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:14,352 INFO L93 Difference]: Finished difference Result 245 states and 492 transitions. [2022-11-03 01:54:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 01:54:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) Word has length 922 [2022-11-03 01:54:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:14,356 INFO L225 Difference]: With dead ends: 245 [2022-11-03 01:54:14,356 INFO L226 Difference]: Without dead ends: 153 [2022-11-03 01:54:14,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1899 GetRequests, 1809 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1293, Invalid=4257, Unknown=0, NotChecked=0, Total=5550 [2022-11-03 01:54:14,360 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 343 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:14,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 219 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:54:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-03 01:54:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2022-11-03 01:54:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 93 states have internal predecessors, (97), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (75), 19 states have call predecessors, (75), 27 states have call successors, (75) [2022-11-03 01:54:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2022-11-03 01:54:14,376 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2022-11-03 01:54:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:14,377 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2022-11-03 01:54:14,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2022-11-03 01:54:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2022-11-03 01:54:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2022-11-03 01:54:14,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:14,390 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:14,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:54:14,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1152068023, now seen corresponding path program 10 times [2022-11-03 01:54:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:14,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184302233] [2022-11-03 01:54:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2022-11-03 01:55:17,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:17,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184302233] [2022-11-03 01:55:17,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184302233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:17,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886254945] [2022-11-03 01:55:17,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:55:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:17,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:17,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:55:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:17,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 2707 conjuncts, 711 conjunts are in the unsatisfiable core [2022-11-03 01:55:17,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2022-11-03 01:55:19,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2022-11-03 01:55:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886254945] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1913077138] [2022-11-03 01:55:31,167 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:55:31,168 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:55:31,168 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:55:31,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:31,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 40 [2022-11-03 01:55:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868193657] [2022-11-03 01:55:31,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:31,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 01:55:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:31,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 01:55:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 01:55:31,173 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-11-03 01:55:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:31,956 INFO L93 Difference]: Finished difference Result 155 states and 250 transitions. [2022-11-03 01:55:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 01:55:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) Word has length 1208 [2022-11-03 01:55:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:31,971 INFO L225 Difference]: With dead ends: 155 [2022-11-03 01:55:31,971 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 01:55:31,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2771 GetRequests, 2579 SyntacticMatches, 154 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 01:55:31,973 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:31,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1040 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:55:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 01:55:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2022-11-03 01:55:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 99 states have internal predecessors, (103), 29 states have call successors, (29), 21 states have call predecessors, (29), 13 states have return successors, (99), 23 states have call predecessors, (99), 29 states have call successors, (99) [2022-11-03 01:55:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 231 transitions. [2022-11-03 01:55:32,003 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 231 transitions. Word has length 1208 [2022-11-03 01:55:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:32,010 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 231 transitions. [2022-11-03 01:55:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 21 states have internal predecessors, (45), 9 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-11-03 01:55:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 231 transitions. [2022-11-03 01:55:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2022-11-03 01:55:32,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:32,024 INFO L195 NwaCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:32,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:32,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:55:32,225 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:55:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -161639444, now seen corresponding path program 11 times [2022-11-03 01:55:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:32,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824758376] [2022-11-03 01:55:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 5811 proven. 3252 refuted. 0 times theorem prover too weak. 106515 trivial. 0 not checked. [2022-11-03 01:55:35,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:35,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824758376] [2022-11-03 01:55:35,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824758376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:35,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584387686] [2022-11-03 01:55:35,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:55:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:35,665 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:35,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:55:36,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2022-11-03 01:55:36,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:36,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 01:55:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 9416 proven. 1010 refuted. 0 times theorem prover too weak. 105152 trivial. 0 not checked. [2022-11-03 01:55:36,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 9416 proven. 1060 refuted. 0 times theorem prover too weak. 105102 trivial. 0 not checked. [2022-11-03 01:55:41,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584387686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:41,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623477199] [2022-11-03 01:55:41,751 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:55:41,751 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:55:41,751 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:55:41,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:41,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 31 [2022-11-03 01:55:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350145183] [2022-11-03 01:55:41,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:55:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:55:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:55:41,758 INFO L87 Difference]: Start difference. First operand 144 states and 231 transitions. Second operand has 31 states, 30 states have (on average 3.066666666666667) internal successors, (92), 31 states have internal predecessors, (92), 19 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (43), 23 states have call predecessors, (43), 19 states have call successors, (43) [2022-11-03 01:55:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:42,644 INFO L93 Difference]: Finished difference Result 345 states and 682 transitions. [2022-11-03 01:55:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 01:55:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.066666666666667) internal successors, (92), 31 states have internal predecessors, (92), 19 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (43), 23 states have call predecessors, (43), 19 states have call successors, (43) Word has length 1385 [2022-11-03 01:55:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:42,655 INFO L225 Difference]: With dead ends: 345 [2022-11-03 01:55:42,655 INFO L226 Difference]: Without dead ends: 179 [2022-11-03 01:55:42,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2813 GetRequests, 2750 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=748, Invalid=2222, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 01:55:42,660 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 120 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:42,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 219 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:55:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-03 01:55:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 155. [2022-11-03 01:55:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.018181818181818) internal successors, (112), 108 states have internal predecessors, (112), 32 states have call successors, (32), 25 states have call predecessors, (32), 12 states have return successors, (69), 21 states have call predecessors, (69), 32 states have call successors, (69) [2022-11-03 01:55:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2022-11-03 01:55:42,685 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 1385 [2022-11-03 01:55:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:42,685 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2022-11-03 01:55:42,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.066666666666667) internal successors, (92), 31 states have internal predecessors, (92), 19 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (43), 23 states have call predecessors, (43), 19 states have call successors, (43) [2022-11-03 01:55:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2022-11-03 01:55:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2022-11-03 01:55:42,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:42,704 INFO L195 NwaCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:42,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:42,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:55:42,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:55:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 297269396, now seen corresponding path program 12 times [2022-11-03 01:55:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:42,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478180719] [2022-11-03 01:55:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 1982 proven. 10170 refuted. 0 times theorem prover too weak. 122452 trivial. 0 not checked. [2022-11-03 01:55:46,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478180719] [2022-11-03 01:55:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478180719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168150447] [2022-11-03 01:55:46,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:55:46,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:46,581 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:46,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:55:47,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:55:47,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:47,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 01:55:47,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 62853 proven. 7462 refuted. 0 times theorem prover too weak. 64289 trivial. 0 not checked. [2022-11-03 01:55:47,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6010 proven. 13838 refuted. 0 times theorem prover too weak. 114756 trivial. 0 not checked. [2022-11-03 01:55:57,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168150447] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:57,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409371028] [2022-11-03 01:55:57,063 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:55:57,063 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:55:57,064 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:55:57,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:57,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 35] total 43 [2022-11-03 01:55:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736595337] [2022-11-03 01:55:57,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:57,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 01:55:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:57,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 01:55:57,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 01:55:57,070 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 37 states have call successors, (42), 2 states have call predecessors, (42), 20 states have return successors, (58), 20 states have call predecessors, (58), 37 states have call successors, (58) [2022-11-03 01:55:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:58,255 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2022-11-03 01:55:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 01:55:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 37 states have call successors, (42), 2 states have call predecessors, (42), 20 states have return successors, (58), 20 states have call predecessors, (58), 37 states have call successors, (58) Word has length 1494 [2022-11-03 01:55:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:58,257 INFO L225 Difference]: With dead ends: 330 [2022-11-03 01:55:58,257 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:55:58,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3036 GetRequests, 2953 SyntacticMatches, 17 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1089, Invalid=3467, Unknown=0, NotChecked=0, Total=4556 [2022-11-03 01:55:58,264 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 243 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:58,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 299 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:55:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:55:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:55:58,266 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-03 01:55:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:55:58,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1494 [2022-11-03 01:55:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:58,268 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:55:58,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 37 states have call successors, (42), 2 states have call predecessors, (42), 20 states have return successors, (58), 20 states have call predecessors, (58), 37 states have call successors, (58) [2022-11-03 01:55:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:55:58,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:55:58,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:55:58,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:58,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:58,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:55:59,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:55:59,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 01:55:59,975 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-11-03 01:55:59,975 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-11-03 01:55:59,975 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|)) [2022-11-03 01:55:59,975 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-03 01:55:59,976 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 10 |ULTIMATE.start_main_~x~0#1|) [2022-11-03 01:55:59,976 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2022-11-03 01:55:59,976 INFO L899 garLoopResultBuilder]: For program point fiboEXIT(lines 7 15) no Hoare annotation was computed. [2022-11-03 01:55:59,976 INFO L899 garLoopResultBuilder]: For program point fiboFINAL(lines 7 15) no Hoare annotation was computed. [2022-11-03 01:55:59,976 INFO L895 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| fibo_~n) (not (<= |fibo_#in~n| 1))) [2022-11-03 01:55:59,977 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-11-03 01:55:59,981 INFO L895 garLoopResultBuilder]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (<= fibo_~n |fibo_#in~n|)) (.cse1 (<= |fibo_#in~n| fibo_~n))) (or (and .cse0 .cse1 (<= 11 |fibo_#in~n|)) (and (<= |fibo_#in~n| 6) (<= |fibo_#t~ret4| 5) (<= 5 |fibo_#t~ret4|) .cse0 .cse1 (<= 6 |fibo_#in~n|)) (and (<= 4 fibo_~n) .cse0 (<= |fibo_#t~ret4| 2) (<= 2 |fibo_#t~ret4|) (<= |fibo_#in~n| 4)) (and (<= |fibo_#t~ret4| 13) (<= 13 |fibo_#t~ret4|) .cse0 .cse1 (<= 8 |fibo_#in~n|) (<= |fibo_#in~n| 8)) (and (<= |fibo_#in~n| 5) .cse0 (<= 3 |fibo_#t~ret4|) .cse1 (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret4| 3)) (and (<= |fibo_#in~n| 3) .cse0 .cse1 (= |fibo_#t~ret4| 1)) (and (<= 7 |fibo_#in~n|) (<= |fibo_#t~ret4| 8) .cse0 .cse1 (<= 8 |fibo_#t~ret4|) (<= |fibo_#in~n| 7)) (and (<= 21 |fibo_#t~ret4|) (<= 9 fibo_~n) .cse0 (<= |fibo_#in~n| 9) (<= |fibo_#t~ret4| 21)) (and (<= |fibo_#t~ret4| 34) (<= 34 |fibo_#t~ret4|) .cse0 .cse1 (<= 10 fibo_~n)))) (< 1 fibo_~n)) [2022-11-03 01:55:59,982 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 14) no Hoare annotation was computed. [2022-11-03 01:55:59,982 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2022-11-03 01:55:59,982 INFO L899 garLoopResultBuilder]: For program point L8(lines 8 14) no Hoare annotation was computed. [2022-11-03 01:55:59,982 INFO L902 garLoopResultBuilder]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2022-11-03 01:55:59,985 INFO L444 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1] [2022-11-03 01:55:59,988 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:56:00,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:56:00 BoogieIcfgContainer [2022-11-03 01:56:00,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:56:00,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:56:00,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:56:00,001 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:56:00,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:42" (3/4) ... [2022-11-03 01:56:00,005 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:56:00,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2022-11-03 01:56:00,014 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-03 01:56:00,014 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 01:56:00,014 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 01:56:00,014 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 01:56:00,043 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:56:00,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:56:00,044 INFO L158 Benchmark]: Toolchain (without parser) took 138025.62ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 95.9MB in the beginning and 709.6MB in the end (delta: -613.6MB). Peak memory consumption was 445.4MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,044 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:56:00,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.70ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 106.0MB in the end (delta: -10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.52ms. Allocated memory is still 130.0MB. Free memory was 106.0MB in the beginning and 104.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,045 INFO L158 Benchmark]: Boogie Preprocessor took 18.95ms. Allocated memory is still 130.0MB. Free memory was 104.6MB in the beginning and 103.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:56:00,045 INFO L158 Benchmark]: RCFGBuilder took 345.47ms. Allocated memory is still 130.0MB. Free memory was 103.2MB in the beginning and 93.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,046 INFO L158 Benchmark]: TraceAbstraction took 137303.88ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 92.7MB in the beginning and 712.7MB in the end (delta: -620.1MB). Peak memory consumption was 442.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,046 INFO L158 Benchmark]: Witness Printer took 41.97ms. Allocated memory is still 1.2GB. Free memory was 711.7MB in the beginning and 709.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:00,048 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.29ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.70ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 106.0MB in the end (delta: -10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.52ms. Allocated memory is still 130.0MB. Free memory was 106.0MB in the beginning and 104.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.95ms. Allocated memory is still 130.0MB. Free memory was 104.6MB in the beginning and 103.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.47ms. Allocated memory is still 130.0MB. Free memory was 103.2MB in the beginning and 93.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 137303.88ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 92.7MB in the beginning and 712.7MB in the end (delta: -620.1MB). Peak memory consumption was 442.1MB. Max. memory is 16.1GB. * Witness Printer took 41.97ms. Allocated memory is still 1.2GB. Free memory was 711.7MB in the beginning and 709.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: 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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 137.2s, OverallIterations: 15, TraceHistogramMax: 219, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.2s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1621 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1547 mSDsluCounter, 2332 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2150 mSDsCounter, 1960 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5228 IncrementalHoareTripleChecker+Invalid, 7188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1960 mSolverCounterUnsat, 325 mSDtfsCounter, 5228 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13599 GetRequests, 12933 SyntacticMatches, 234 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5031 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=14, InterpolantAutomatonStates: 287, 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, 15 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 413 PreInvPairs, 740 NumberOfFragments, 174 HoareAnnotationTreeSize, 413 FomulaSimplifications, 4976 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 7625 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 120.4s InterpolantComputationTime, 12931 NumberOfCodeBlocks, 11291 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 19346 ConstructedInterpolants, 0 QuantifiedInterpolants, 30971 SizeOfPredicates, 76 NumberOfNonLiveVariables, 10696 ConjunctsInSsa, 885 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1105197/1258845 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: 28]: Loop Invariant Derived loop invariant: 10 <= x RESULT: Ultimate proved your program to be correct! [2022-11-03 01:56:00,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7b0fa8b-1a61-4ef7-a73d-cb06c66c419f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE