./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V --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 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:55:36,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:55:36,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:55:36,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:55:36,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:55:36,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:55:36,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:55:36,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:55:36,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:55:36,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:55:36,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:55:36,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:55:36,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:55:36,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:55:36,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:55:36,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:55:36,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:55:36,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:55:36,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:55:36,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:55:36,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:55:36,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:55:36,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:55:36,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:55:36,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:55:36,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:55:36,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:55:36,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:55:36,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:55:36,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:55:36,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:55:36,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:55:36,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:55:36,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:55:36,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:55:36,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:55:36,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:55:36,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:55:36,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:55:36,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:55:36,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:55:36,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:55:36,531 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:55:36,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:55:36,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:55:36,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:55:36,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:55:36,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:55:36,534 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:55:36,534 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:55:36,535 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:55:36,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:55:36,535 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:55:36,536 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:55:36,536 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:55:36,536 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:55:36,537 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:55:36,537 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:55:36,538 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:55:36,538 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:55:36,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:55:36,539 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:55:36,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:55:36,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:55:36,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:55:36,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:55:36,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:55:36,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:55:36,542 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:55:36,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:55:36,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:55:36,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:55:36,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:55:36,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:55:36,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:55:36,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:55:36,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:55:36,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:55:36,545 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:55:36,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:55:36,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:55:36,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:55:36,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:55:36,546 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/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_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V 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 -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2021-11-23 03:55:36,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:55:36,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:55:36,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:55:36,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:55:36,947 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:55:36,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-11-23 03:55:37,037 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/data/10e9d3e5c/920beba6825649678d10dd7189bdbe97/FLAG01ec3fb61 [2021-11-23 03:55:37,647 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:55:37,648 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-11-23 03:55:37,662 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/data/10e9d3e5c/920beba6825649678d10dd7189bdbe97/FLAG01ec3fb61 [2021-11-23 03:55:38,004 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/data/10e9d3e5c/920beba6825649678d10dd7189bdbe97 [2021-11-23 03:55:38,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:55:38,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:55:38,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:55:38,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:55:38,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:55:38,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72892d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38, skipping insertion in model container [2021-11-23 03:55:38,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:55:38,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:55:38,364 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_0154f08a-9663-424c-9466-8a679ea75a0d/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-11-23 03:55:38,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:55:38,379 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:55:38,396 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_0154f08a-9663-424c-9466-8a679ea75a0d/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-11-23 03:55:38,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:55:38,414 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:55:38,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38 WrapperNode [2021-11-23 03:55:38,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:55:38,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:55:38,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:55:38,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:55:38,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,454 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-11-23 03:55:38,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:55:38,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:55:38,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:55:38,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:55:38,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:55:38,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:55:38,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:55:38,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:55:38,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (1/1) ... [2021-11-23 03:55:38,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:55:38,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:38,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:55:38,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:55:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:55:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:55:38,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:55:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:55:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-11-23 03:55:38,584 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-11-23 03:55:38,667 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:55:38,675 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:55:38,839 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:55:38,857 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:55:38,861 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 03:55:38,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:38 BoogieIcfgContainer [2021-11-23 03:55:38,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:55:38,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:55:38,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:55:38,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:55:38,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:38" (1/3) ... [2021-11-23 03:55:38,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c2b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:38, skipping insertion in model container [2021-11-23 03:55:38,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:38" (2/3) ... [2021-11-23 03:55:38,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c2b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:38, skipping insertion in model container [2021-11-23 03:55:38,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:38" (3/3) ... [2021-11-23 03:55:38,880 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2021-11-23 03:55:38,889 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:55:38,890 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:55:38,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:55:38,981 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:55:38,982 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:55:39,008 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) [2021-11-23 03:55:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 03:55:39,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:39,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:39,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1688587911, now seen corresponding path program 1 times [2021-11-23 03:55:39,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:39,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920090921] [2021-11-23 03:55:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:39,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:39,346 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920090921] [2021-11-23 03:55:39,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920090921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:39,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:39,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:39,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464122810] [2021-11-23 03:55:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:39,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:39,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:39,442 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:55:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:39,549 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-11-23 03:55:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:55:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-23 03:55:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:39,566 INFO L225 Difference]: With dead ends: 27 [2021-11-23 03:55:39,566 INFO L226 Difference]: Without dead ends: 17 [2021-11-23 03:55:39,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:39,579 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:39,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-23 03:55:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-23 03:55:39,634 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) [2021-11-23 03:55:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-11-23 03:55:39,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-11-23 03:55:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:39,642 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-11-23 03:55:39,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:55:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-11-23 03:55:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 03:55:39,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:39,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:39,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:55:39,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1521360425, now seen corresponding path program 1 times [2021-11-23 03:55:39,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:39,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085967714] [2021-11-23 03:55:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:39,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:55:39,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085967714] [2021-11-23 03:55:39,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085967714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:55:39,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:55:39,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:55:39,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745168673] [2021-11-23 03:55:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:55:39,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:55:39,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:39,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:55:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:39,786 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:55:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:39,819 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-23 03:55:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:55:39,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-23 03:55:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:39,821 INFO L225 Difference]: With dead ends: 23 [2021-11-23 03:55:39,821 INFO L226 Difference]: Without dead ends: 19 [2021-11-23 03:55:39,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:55:39,824 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:39,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:55:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-23 03:55:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-23 03:55:39,832 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) [2021-11-23 03:55:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-11-23 03:55:39,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-11-23 03:55:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:39,834 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-11-23 03:55:39,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:55:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-11-23 03:55:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:55:39,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:39,836 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:39,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:55:39,837 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1124411740, now seen corresponding path program 1 times [2021-11-23 03:55:39,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:39,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105717776] [2021-11-23 03:55:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:39,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:55:39,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:39,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105717776] [2021-11-23 03:55:39,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105717776] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:39,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858886786] [2021-11-23 03:55:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:39,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:39,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:39,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:39,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:55:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:40,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 03:55:40,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:55:40,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:55:40,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858886786] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2084819550] [2021-11-23 03:55:40,768 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:40,768 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:40,773 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:40,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:40,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-11-23 03:55:40,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92301130] [2021-11-23 03:55:40,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:40,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 03:55:40,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:40,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 03:55:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:55:40,780 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) [2021-11-23 03:55:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:40,979 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-11-23 03:55:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:40,980 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 [2021-11-23 03:55:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:40,981 INFO L225 Difference]: With dead ends: 34 [2021-11-23 03:55:40,982 INFO L226 Difference]: Without dead ends: 19 [2021-11-23 03:55:40,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-23 03:55:40,985 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:40,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-23 03:55:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-23 03:55:40,992 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) [2021-11-23 03:55:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-11-23 03:55:40,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-11-23 03:55:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:40,995 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-11-23 03:55:40,995 INFO L471 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) [2021-11-23 03:55:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-11-23 03:55:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 03:55:40,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:40,998 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:41,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:41,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:41,208 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 992661418, now seen corresponding path program 1 times [2021-11-23 03:55:41,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:41,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759096806] [2021-11-23 03:55:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:41,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:55:41,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:41,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759096806] [2021-11-23 03:55:41,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759096806] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866164666] [2021-11-23 03:55:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:41,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:41,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:41,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 03:55:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:41,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 03:55:41,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:55:41,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:55:41,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866164666] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [277736654] [2021-11-23 03:55:41,729 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:41,735 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:41,736 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:41,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:41,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-11-23 03:55:41,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348732689] [2021-11-23 03:55:41,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:41,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:55:41,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:55:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:55:41,742 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) [2021-11-23 03:55:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:41,835 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-11-23 03:55:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:55:41,840 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 [2021-11-23 03:55:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:41,849 INFO L225 Difference]: With dead ends: 28 [2021-11-23 03:55:41,849 INFO L226 Difference]: Without dead ends: 24 [2021-11-23 03:55:41,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:55:41,857 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:41,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 38 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-23 03:55:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-23 03:55:41,875 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) [2021-11-23 03:55:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-11-23 03:55:41,879 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-11-23 03:55:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:41,880 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-11-23 03:55:41,881 INFO L471 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) [2021-11-23 03:55:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-11-23 03:55:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 03:55:41,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:41,889 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:41,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:42,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:42,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1950959585, now seen corresponding path program 2 times [2021-11-23 03:55:42,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:42,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736053266] [2021-11-23 03:55:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:42,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 03:55:42,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736053266] [2021-11-23 03:55:42,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736053266] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124695636] [2021-11-23 03:55:42,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:55:42,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:42,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:42,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 03:55:42,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 03:55:42,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:55:42,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 03:55:42,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-23 03:55:42,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 03:55:42,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124695636] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400909183] [2021-11-23 03:55:42,785 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:42,785 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:42,786 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:42,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:42,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-11-23 03:55:42,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006175205] [2021-11-23 03:55:42,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:42,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 03:55:42,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 03:55:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-23 03:55:42,791 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) [2021-11-23 03:55:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:43,051 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-11-23 03:55:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 03:55:43,052 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 [2021-11-23 03:55:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:43,055 INFO L225 Difference]: With dead ends: 55 [2021-11-23 03:55:43,055 INFO L226 Difference]: Without dead ends: 33 [2021-11-23 03:55:43,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-11-23 03:55:43,057 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:43,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-11-23 03:55:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-11-23 03:55:43,067 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) [2021-11-23 03:55:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-11-23 03:55:43,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-11-23 03:55:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:43,070 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-11-23 03:55:43,070 INFO L471 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) [2021-11-23 03:55:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-11-23 03:55:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 03:55:43,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:43,072 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:43,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:43,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:43,300 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1865467761, now seen corresponding path program 3 times [2021-11-23 03:55:43,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:43,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250377868] [2021-11-23 03:55:43,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:43,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 03:55:43,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250377868] [2021-11-23 03:55:43,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250377868] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335962923] [2021-11-23 03:55:43,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 03:55:43,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:43,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:43,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 03:55:43,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 03:55:43,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:55:43,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 03:55:43,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 03:55:43,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:55:43,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335962923] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:43,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1707929365] [2021-11-23 03:55:43,991 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:43,992 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:43,992 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:43,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:43,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-11-23 03:55:43,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882010500] [2021-11-23 03:55:43,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:43,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 03:55:43,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 03:55:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:55:43,995 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) [2021-11-23 03:55:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:44,093 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-11-23 03:55:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:55:44,094 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 [2021-11-23 03:55:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:44,099 INFO L225 Difference]: With dead ends: 36 [2021-11-23 03:55:44,099 INFO L226 Difference]: Without dead ends: 32 [2021-11-23 03:55:44,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-23 03:55:44,102 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:44,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-23 03:55:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-23 03:55:44,126 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) [2021-11-23 03:55:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-11-23 03:55:44,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-11-23 03:55:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:44,130 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-11-23 03:55:44,131 INFO L471 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) [2021-11-23 03:55:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-11-23 03:55:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-23 03:55:44,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:44,145 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:44,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:44,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 03:55:44,355 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1351422375, now seen corresponding path program 4 times [2021-11-23 03:55:44,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:44,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628562062] [2021-11-23 03:55:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:44,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-23 03:55:44,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:44,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628562062] [2021-11-23 03:55:44,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628562062] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:44,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309908959] [2021-11-23 03:55:44,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 03:55:44,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:44,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:44,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 03:55:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:44,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 03:55:44,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-23 03:55:44,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-23 03:55:45,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309908959] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [964309564] [2021-11-23 03:55:45,444 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:45,444 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:45,445 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:45,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:45,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-11-23 03:55:45,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465986634] [2021-11-23 03:55:45,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:45,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 03:55:45,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 03:55:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-23 03:55:45,455 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) [2021-11-23 03:55:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:45,592 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-11-23 03:55:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:55:45,593 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 [2021-11-23 03:55:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:45,598 INFO L225 Difference]: With dead ends: 41 [2021-11-23 03:55:45,598 INFO L226 Difference]: Without dead ends: 37 [2021-11-23 03:55:45,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:55:45,600 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:45,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 42 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-23 03:55:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-11-23 03:55:45,617 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) [2021-11-23 03:55:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-11-23 03:55:45,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2021-11-23 03:55:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:45,626 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-11-23 03:55:45,626 INFO L471 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) [2021-11-23 03:55:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-11-23 03:55:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-11-23 03:55:45,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:45,644 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:45,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:45,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:45,860 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1437906103, now seen corresponding path program 5 times [2021-11-23 03:55:45,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:45,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856255067] [2021-11-23 03:55:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:45,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2021-11-23 03:55:46,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856255067] [2021-11-23 03:55:46,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856255067] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581298406] [2021-11-23 03:55:46,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:55:46,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:46,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:46,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 03:55:46,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-23 03:55:46,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:55:46,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 03:55:46,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2021-11-23 03:55:46,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2021-11-23 03:55:47,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581298406] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147957674] [2021-11-23 03:55:47,640 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:47,640 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:47,642 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:47,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:47,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2021-11-23 03:55:47,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207591187] [2021-11-23 03:55:47,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:47,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 03:55:47,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 03:55:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-11-23 03:55:47,648 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) [2021-11-23 03:55:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:48,095 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2021-11-23 03:55:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 03:55:48,096 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 [2021-11-23 03:55:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:48,098 INFO L225 Difference]: With dead ends: 94 [2021-11-23 03:55:48,099 INFO L226 Difference]: Without dead ends: 58 [2021-11-23 03:55:48,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2021-11-23 03:55:48,103 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 115 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:48,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 74 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:55:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-23 03:55:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-11-23 03:55:48,114 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) [2021-11-23 03:55:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2021-11-23 03:55:48,116 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 202 [2021-11-23 03:55:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:48,116 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2021-11-23 03:55:48,117 INFO L471 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) [2021-11-23 03:55:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2021-11-23 03:55:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 03:55:48,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:48,120 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:48,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:48,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:48,348 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1858393177, now seen corresponding path program 6 times [2021-11-23 03:55:48,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:48,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634420299] [2021-11-23 03:55:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:48,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:55:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-11-23 03:55:48,538 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:55:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634420299] [2021-11-23 03:55:48,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634420299] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:55:48,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74441361] [2021-11-23 03:55:48,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 03:55:48,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:55:48,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:55:48,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 03:55:48,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 03:55:48,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:55:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 03:55:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:55:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-11-23 03:55:48,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:55:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-11-23 03:55:50,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74441361] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:55:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542170643] [2021-11-23 03:55:50,431 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-23 03:55:50,431 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:55:50,432 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 03:55:50,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:55:50,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2021-11-23 03:55:50,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344938106] [2021-11-23 03:55:50,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:55:50,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 03:55:50,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:55:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 03:55:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-11-23 03:55:50,439 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2021-11-23 03:55:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:55:50,667 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2021-11-23 03:55:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 03:55:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 173 [2021-11-23 03:55:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:55:50,670 INFO L225 Difference]: With dead ends: 67 [2021-11-23 03:55:50,670 INFO L226 Difference]: Without dead ends: 63 [2021-11-23 03:55:50,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2021-11-23 03:55:50,672 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 120 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:55:50,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 57 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:55:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-23 03:55:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-23 03:55:50,682 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) [2021-11-23 03:55:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2021-11-23 03:55:50,684 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2021-11-23 03:55:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:55:50,685 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2021-11-23 03:55:50,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2021-11-23 03:55:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2021-11-23 03:55:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-11-23 03:55:50,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:55:50,691 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2021-11-23 03:55:50,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 03:55:50,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:55:50,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:55:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:55:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1234663993, now seen corresponding path program 7 times [2021-11-23 03:55:50,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:55:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201654164] [2021-11-23 03:55:50,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:55:50,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:55:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 03:55:51,007 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 03:55:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 03:55:51,160 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 03:55:51,160 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 03:55:51,161 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 03:55:51,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 03:55:51,167 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2021-11-23 03:55:51,171 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 03:55:51,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:51 BoogieIcfgContainer [2021-11-23 03:55:51,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 03:55:51,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 03:55:51,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 03:55:51,293 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 03:55:51,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:38" (3/4) ... [2021-11-23 03:55:51,295 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 03:55:51,425 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 03:55:51,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 03:55:51,426 INFO L158 Benchmark]: Toolchain (without parser) took 13413.52ms. Allocated memory was 117.4MB in the beginning and 186.6MB in the end (delta: 69.2MB). Free memory was 76.5MB in the beginning and 111.5MB in the end (delta: -34.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,426 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:55:51,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.21ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 93.6MB in the end (delta: -17.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,427 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 91.5MB in the end (delta: 481.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:55:51,428 INFO L158 Benchmark]: RCFGBuilder took 386.76ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 82.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,428 INFO L158 Benchmark]: TraceAbstraction took 12422.01ms. Allocated memory was 117.4MB in the beginning and 186.6MB in the end (delta: 69.2MB). Free memory was 82.0MB in the beginning and 118.8MB in the end (delta: -36.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,429 INFO L158 Benchmark]: Witness Printer took 132.76ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 111.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 03:55:51,431 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.34ms. Allocated memory is still 117.4MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.21ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 93.6MB in the end (delta: -17.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 91.5MB in the end (delta: 481.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 386.76ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 82.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12422.01ms. Allocated memory was 117.4MB in the beginning and 186.6MB in the end (delta: 69.2MB). Free memory was 82.0MB in the beginning and 118.8MB in the end (delta: -36.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Witness Printer took 132.76ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 111.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] reach_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 10, TraceHistogramMax: 41, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 665 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 120 mSDtfsCounter, 665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 1095 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=9, InterpolantAutomatonStates: 82, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1667 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1089 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 10084/12759 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 RESULT: Ultimate proved your program to be incorrect! [2021-11-23 03:55:51,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0154f08a-9663-424c-9466-8a679ea75a0d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE