./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 09:46:25,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 09:46:25,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 09:46:25,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 09:46:25,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 09:46:25,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 09:46:25,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 09:46:25,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 09:46:25,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 09:46:25,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 09:46:25,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 09:46:25,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 09:46:25,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 09:46:25,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 09:46:25,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 09:46:25,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 09:46:25,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 09:46:25,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 09:46:25,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 09:46:25,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 09:46:25,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 09:46:25,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 09:46:25,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 09:46:25,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 09:46:25,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 09:46:25,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 09:46:25,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 09:46:25,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 09:46:25,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 09:46:25,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 09:46:25,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 09:46:25,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 09:46:25,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 09:46:25,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 09:46:25,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 09:46:25,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 09:46:25,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 09:46:25,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 09:46:25,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 09:46:25,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 09:46:25,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 09:46:25,669 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 09:46:25,695 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 09:46:25,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 09:46:25,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 09:46:25,697 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 09:46:25,697 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 09:46:25,697 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 09:46:25,698 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 09:46:25,698 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 09:46:25,698 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 09:46:25,699 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 09:46:25,699 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 09:46:25,699 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 09:46:25,700 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 09:46:25,700 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 09:46:25,701 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 09:46:25,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 09:46:25,702 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 09:46:25,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 09:46:25,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 09:46:25,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 09:46:25,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 09:46:25,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 09:46:25,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 09:46:25,704 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 09:46:25,705 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 09:46:25,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 09:46:25,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 09:46:25,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 09:46:25,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 09:46:25,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 09:46:25,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 09:46:25,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 09:46:25,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 09:46:25,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 09:46:25,708 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 09:46:25,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 09:46:25,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 09:46:25,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 09:46:25,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 09:46:25,709 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_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/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_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2021-10-24 09:46:25,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 09:46:25,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 09:46:25,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 09:46:25,980 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 09:46:25,980 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 09:46:25,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-10-24 09:46:26,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/data/e934c062c/b65d943d67e1417489b0d994ec0d8c0a/FLAG68f24129e [2021-10-24 09:46:26,543 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 09:46:26,543 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-10-24 09:46:26,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/data/e934c062c/b65d943d67e1417489b0d994ec0d8c0a/FLAG68f24129e [2021-10-24 09:46:26,935 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/data/e934c062c/b65d943d67e1417489b0d994ec0d8c0a [2021-10-24 09:46:26,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 09:46:26,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 09:46:26,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 09:46:26,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 09:46:26,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 09:46:26,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:46:26" (1/1) ... [2021-10-24 09:46:26,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720bbb13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:26, skipping insertion in model container [2021-10-24 09:46:26,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:46:26" (1/1) ... [2021-10-24 09:46:26,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 09:46:26,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 09:46:27,166 WARN L228 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_755b7879-1abd-4d70-bd05-c2c5ff882a9d/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-10-24 09:46:27,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 09:46:27,182 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 09:46:27,205 WARN L228 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_755b7879-1abd-4d70-bd05-c2c5ff882a9d/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-10-24 09:46:27,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 09:46:27,224 INFO L208 MainTranslator]: Completed translation [2021-10-24 09:46:27,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27 WrapperNode [2021-10-24 09:46:27,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 09:46:27,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 09:46:27,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 09:46:27,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 09:46:27,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 09:46:27,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 09:46:27,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 09:46:27,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 09:46:27,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 09:46:27,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 09:46:27,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 09:46:27,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 09:46:27,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (1/1) ... [2021-10-24 09:46:27,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 09:46:27,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:27,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 09:46:27,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 09:46:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 09:46:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-10-24 09:46:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-10-24 09:46:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 09:46:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-10-24 09:46:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-10-24 09:46:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 09:46:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 09:46:27,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 09:46:27,686 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-24 09:46:27,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:46:27 BoogieIcfgContainer [2021-10-24 09:46:27,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 09:46:27,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 09:46:27,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 09:46:27,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 09:46:27,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:46:26" (1/3) ... [2021-10-24 09:46:27,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc7ce5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:46:27, skipping insertion in model container [2021-10-24 09:46:27,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:46:27" (2/3) ... [2021-10-24 09:46:27,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc7ce5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:46:27, skipping insertion in model container [2021-10-24 09:46:27,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:46:27" (3/3) ... [2021-10-24 09:46:27,697 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-10-24 09:46:27,701 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 09:46:27,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-24 09:46:27,766 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 09:46:27,773 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-10-24 09:46:27,773 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-24 09:46:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-24 09:46:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 09:46:27,793 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:27,794 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:27,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2021-10-24 09:46:27,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:27,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305503283] [2021-10-24 09:46:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:27,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:46:28,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:28,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305503283] [2021-10-24 09:46:28,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305503283] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:46:28,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:46:28,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:46:28,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514119041] [2021-10-24 09:46:28,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:46:28,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:28,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:46:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:46:28,082 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 09:46:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:28,138 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-10-24 09:46:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 09:46:28,140 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-10-24 09:46:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:28,149 INFO L225 Difference]: With dead ends: 36 [2021-10-24 09:46:28,166 INFO L226 Difference]: Without dead ends: 26 [2021-10-24 09:46:28,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:46:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-24 09:46:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-24 09:46:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-10-24 09:46:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-24 09:46:28,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-10-24 09:46:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:28,208 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-24 09:46:28,209 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-10-24 09:46:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-24 09:46:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-24 09:46:28,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:28,211 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:28,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 09:46:28,211 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2021-10-24 09:46:28,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:28,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057982232] [2021-10-24 09:46:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:28,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:46:28,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:28,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057982232] [2021-10-24 09:46:28,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057982232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:46:28,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:46:28,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:46:28,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773189783] [2021-10-24 09:46:28,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:46:28,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:46:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:46:28,266 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 09:46:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:28,285 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-10-24 09:46:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 09:46:28,286 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-10-24 09:46:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:28,287 INFO L225 Difference]: With dead ends: 32 [2021-10-24 09:46:28,287 INFO L226 Difference]: Without dead ends: 28 [2021-10-24 09:46:28,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:46:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-24 09:46:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-10-24 09:46:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-10-24 09:46:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-24 09:46:28,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-10-24 09:46:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:28,297 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-24 09:46:28,297 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-10-24 09:46:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-24 09:46:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 09:46:28,299 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:28,299 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:28,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 09:46:28,300 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2021-10-24 09:46:28,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:28,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334866598] [2021-10-24 09:46:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:28,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 09:46:28,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:28,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334866598] [2021-10-24 09:46:28,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334866598] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:28,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693559994] [2021-10-24 09:46:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:28,393 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:28,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:28,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 09:46:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:28,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-24 09:46:28,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 09:46:28,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 09:46:29,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693559994] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:29,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636461188] [2021-10-24 09:46:29,146 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-24 09:46:29,146 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:29,151 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-24 09:46:29,157 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-24 09:46:29,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-24 09:46:29,190 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,197 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-24 09:46:29,198 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,199 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-24 09:46:29,200 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-24 09:46:29,201 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,201 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-24 09:46:29,204 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 122 [2021-10-24 09:46:29,223 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_9|], 21=[|v_#valid_10|]} [2021-10-24 09:46:29,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-24 09:46:29,266 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,267 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-24 09:46:29,268 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,269 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-24 09:46:29,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-24 09:46:29,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-24 09:46:29,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-10-24 09:46:29,329 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,333 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-10-24 09:46:29,334 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,335 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-10-24 09:46:29,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-24 09:46:29,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,372 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,376 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-24 09:46:29,377 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:94 [2021-10-24 09:46:29,391 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,398 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,409 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,412 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-10-24 09:46:29,418 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,422 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-10-24 09:46:29,424 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,431 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-10-24 09:46:29,434 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,438 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-10-24 09:46:29,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:46:29,488 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,502 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,505 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,506 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 57 for LOIs [2021-10-24 09:46:29,521 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,525 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,529 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,534 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-10-24 09:46:29,539 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,542 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,546 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,551 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-10-24 09:46:29,555 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-24 09:46:29,559 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-24 09:46:29,560 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 57 for LOIs [2021-10-24 09:46:29,565 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-24 09:46:30,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [636461188] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:46:30,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:30,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2021-10-24 09:46:30,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199777033] [2021-10-24 09:46:30,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-24 09:46:30,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:30,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-24 09:46:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-24 09:46:30,281 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 09:46:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:30,439 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-10-24 09:46:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 09:46:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-10-24 09:46:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:30,446 INFO L225 Difference]: With dead ends: 68 [2021-10-24 09:46:30,447 INFO L226 Difference]: Without dead ends: 44 [2021-10-24 09:46:30,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 812.7ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-24 09:46:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-24 09:46:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-10-24 09:46:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-10-24 09:46:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-10-24 09:46:30,468 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2021-10-24 09:46:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:30,469 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-10-24 09:46:30,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 09:46:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2021-10-24 09:46:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-24 09:46:30,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:30,476 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:30,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:30,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:30,703 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2021-10-24 09:46:30,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:30,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515257839] [2021-10-24 09:46:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:30,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-24 09:46:30,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:30,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515257839] [2021-10-24 09:46:30,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515257839] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:30,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604667764] [2021-10-24 09:46:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:30,802 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:30,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:30,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 09:46:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:30,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 09:46:30,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 09:46:31,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 09:46:31,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604667764] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:31,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354830058] [2021-10-24 09:46:31,565 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:31,566 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:31,568 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:608) 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-10-24 09:46:31,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:31,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-10-24 09:46:31,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852383116] [2021-10-24 09:46:31,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-24 09:46:31,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-24 09:46:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-24 09:46:31,574 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-10-24 09:46:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:31,759 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2021-10-24 09:46:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-24 09:46:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2021-10-24 09:46:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:31,764 INFO L225 Difference]: With dead ends: 85 [2021-10-24 09:46:31,765 INFO L226 Difference]: Without dead ends: 53 [2021-10-24 09:46:31,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 146.8ms TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-10-24 09:46:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-24 09:46:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-10-24 09:46:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2021-10-24 09:46:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-10-24 09:46:31,789 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2021-10-24 09:46:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:31,790 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-10-24 09:46:31,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-10-24 09:46:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-10-24 09:46:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-24 09:46:31,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:31,797 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:31,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:32,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-24 09:46:32,011 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2021-10-24 09:46:32,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:32,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164828545] [2021-10-24 09:46:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:32,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-24 09:46:32,126 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:32,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164828545] [2021-10-24 09:46:32,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164828545] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:32,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081617736] [2021-10-24 09:46:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:32,127 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:32,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:32,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 09:46:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:32,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 09:46:32,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-24 09:46:32,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 09:46:32,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081617736] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:32,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813567294] [2021-10-24 09:46:32,849 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:32,849 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:32,850 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:608) 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-10-24 09:46:32,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:32,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-10-24 09:46:32,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266362784] [2021-10-24 09:46:32,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-24 09:46:32,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:32,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-24 09:46:32,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-10-24 09:46:32,854 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-10-24 09:46:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:33,371 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2021-10-24 09:46:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-24 09:46:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-10-24 09:46:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:33,376 INFO L225 Difference]: With dead ends: 121 [2021-10-24 09:46:33,376 INFO L226 Difference]: Without dead ends: 77 [2021-10-24 09:46:33,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 278.4ms TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-10-24 09:46:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-24 09:46:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-10-24 09:46:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2021-10-24 09:46:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2021-10-24 09:46:33,406 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2021-10-24 09:46:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:33,407 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2021-10-24 09:46:33,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-10-24 09:46:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2021-10-24 09:46:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-24 09:46:33,412 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:33,413 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:33,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:33,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:33,639 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2021-10-24 09:46:33,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:33,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202222938] [2021-10-24 09:46:33,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:33,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-24 09:46:33,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:33,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202222938] [2021-10-24 09:46:33,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202222938] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:33,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310599851] [2021-10-24 09:46:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:33,722 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:33,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:33,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 09:46:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:33,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-24 09:46:33,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-24 09:46:34,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-24 09:46:34,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310599851] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:34,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613449727] [2021-10-24 09:46:34,633 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:34,633 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:34,635 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:608) 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-10-24 09:46:34,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:34,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2021-10-24 09:46:34,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017620482] [2021-10-24 09:46:34,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-24 09:46:34,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-24 09:46:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-10-24 09:46:34,640 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-10-24 09:46:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:34,863 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2021-10-24 09:46:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-24 09:46:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2021-10-24 09:46:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:34,871 INFO L225 Difference]: With dead ends: 119 [2021-10-24 09:46:34,871 INFO L226 Difference]: Without dead ends: 97 [2021-10-24 09:46:34,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 152.9ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-24 09:46:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-24 09:46:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2021-10-24 09:46:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2021-10-24 09:46:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2021-10-24 09:46:34,909 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2021-10-24 09:46:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:34,911 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2021-10-24 09:46:34,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-10-24 09:46:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2021-10-24 09:46:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-24 09:46:34,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:34,915 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:34,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:35,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-24 09:46:35,136 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2021-10-24 09:46:35,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:35,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063522199] [2021-10-24 09:46:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:35,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-10-24 09:46:35,299 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:35,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063522199] [2021-10-24 09:46:35,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063522199] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:35,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100192985] [2021-10-24 09:46:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:35,300 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:35,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:35,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-24 09:46:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:35,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-24 09:46:35,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-10-24 09:46:35,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-24 09:46:36,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100192985] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:36,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [355166732] [2021-10-24 09:46:36,742 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:36,743 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:36,743 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:608) 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-10-24 09:46:36,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:36,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-10-24 09:46:36,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396231083] [2021-10-24 09:46:36,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-24 09:46:36,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:36,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-24 09:46:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-10-24 09:46:36,748 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-10-24 09:46:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:37,528 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2021-10-24 09:46:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-24 09:46:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2021-10-24 09:46:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:37,531 INFO L225 Difference]: With dead ends: 204 [2021-10-24 09:46:37,532 INFO L226 Difference]: Without dead ends: 115 [2021-10-24 09:46:37,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 435.4ms TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-10-24 09:46:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-24 09:46:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2021-10-24 09:46:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2021-10-24 09:46:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2021-10-24 09:46:37,552 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2021-10-24 09:46:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:37,553 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2021-10-24 09:46:37,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-10-24 09:46:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2021-10-24 09:46:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-24 09:46:37,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:37,556 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:37,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:37,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-24 09:46:37,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2021-10-24 09:46:37,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:37,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298833927] [2021-10-24 09:46:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:37,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-10-24 09:46:37,853 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:37,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298833927] [2021-10-24 09:46:37,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298833927] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:37,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890355768] [2021-10-24 09:46:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:37,854 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:37,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:37,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:37,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-24 09:46:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:38,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 09:46:38,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-10-24 09:46:38,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-10-24 09:46:39,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890355768] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:39,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623130202] [2021-10-24 09:46:39,910 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:39,910 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:39,911 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:608) 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-10-24 09:46:39,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:39,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2021-10-24 09:46:39,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379430204] [2021-10-24 09:46:39,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-24 09:46:39,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-24 09:46:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-10-24 09:46:39,916 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-10-24 09:46:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:40,232 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2021-10-24 09:46:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-24 09:46:40,233 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 130 [2021-10-24 09:46:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:40,234 INFO L225 Difference]: With dead ends: 191 [2021-10-24 09:46:40,235 INFO L226 Difference]: Without dead ends: 103 [2021-10-24 09:46:40,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 274.1ms TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-10-24 09:46:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-24 09:46:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-10-24 09:46:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2021-10-24 09:46:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2021-10-24 09:46:40,252 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2021-10-24 09:46:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:40,253 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2021-10-24 09:46:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-10-24 09:46:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2021-10-24 09:46:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-24 09:46:40,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:40,255 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:40,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-24 09:46:40,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-24 09:46:40,479 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2021-10-24 09:46:40,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:40,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331538652] [2021-10-24 09:46:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:40,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-10-24 09:46:40,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:40,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331538652] [2021-10-24 09:46:40,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331538652] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:40,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519234036] [2021-10-24 09:46:40,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 09:46:40,615 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:40,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:40,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-24 09:46:40,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-24 09:46:40,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:46:40,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 09:46:40,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-10-24 09:46:41,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-10-24 09:46:41,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519234036] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:41,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86550329] [2021-10-24 09:46:41,841 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:41,842 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:41,843 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:608) 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-10-24 09:46:41,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:41,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2021-10-24 09:46:41,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52648960] [2021-10-24 09:46:41,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-24 09:46:41,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-24 09:46:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-10-24 09:46:41,852 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-10-24 09:46:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:42,077 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2021-10-24 09:46:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-24 09:46:42,077 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2021-10-24 09:46:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:42,080 INFO L225 Difference]: With dead ends: 132 [2021-10-24 09:46:42,080 INFO L226 Difference]: Without dead ends: 118 [2021-10-24 09:46:42,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 141.6ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-24 09:46:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-24 09:46:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-10-24 09:46:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2021-10-24 09:46:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-10-24 09:46:42,104 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2021-10-24 09:46:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:42,104 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-10-24 09:46:42,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-10-24 09:46:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-10-24 09:46:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-24 09:46:42,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:42,112 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:42,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:42,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-24 09:46:42,339 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2021-10-24 09:46:42,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:42,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874094608] [2021-10-24 09:46:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:42,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2021-10-24 09:46:42,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:42,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874094608] [2021-10-24 09:46:42,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874094608] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:42,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380248248] [2021-10-24 09:46:42,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-24 09:46:42,541 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:42,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:42,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-24 09:46:43,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-24 09:46:43,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:46:43,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-24 09:46:43,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-10-24 09:46:43,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2021-10-24 09:46:44,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380248248] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:44,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052011019] [2021-10-24 09:46:44,543 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:44,543 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:44,544 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:608) 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-10-24 09:46:44,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:44,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2021-10-24 09:46:44,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158207783] [2021-10-24 09:46:44,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-24 09:46:44,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-24 09:46:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-10-24 09:46:44,549 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-10-24 09:46:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:44,779 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2021-10-24 09:46:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-24 09:46:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2021-10-24 09:46:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:44,782 INFO L225 Difference]: With dead ends: 213 [2021-10-24 09:46:44,782 INFO L226 Difference]: Without dead ends: 113 [2021-10-24 09:46:44,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 184.9ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-24 09:46:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-24 09:46:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-10-24 09:46:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2021-10-24 09:46:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2021-10-24 09:46:44,798 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2021-10-24 09:46:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:44,799 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-10-24 09:46:44,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-10-24 09:46:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2021-10-24 09:46:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-10-24 09:46:44,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:44,804 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:44,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:45,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-24 09:46:45,019 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2021-10-24 09:46:45,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:45,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539204755] [2021-10-24 09:46:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:45,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-10-24 09:46:45,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:45,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539204755] [2021-10-24 09:46:45,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539204755] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:45,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437299701] [2021-10-24 09:46:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:45,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:45,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:45,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-24 09:46:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:45,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 09:46:45,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-10-24 09:46:46,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-10-24 09:46:47,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437299701] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:47,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [783055277] [2021-10-24 09:46:47,839 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:47,839 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:47,839 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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:608) 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-10-24 09:46:47,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:47,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2021-10-24 09:46:47,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737598927] [2021-10-24 09:46:47,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-24 09:46:47,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-24 09:46:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-10-24 09:46:47,843 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-10-24 09:46:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:48,055 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2021-10-24 09:46:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-24 09:46:48,055 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2021-10-24 09:46:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:48,058 INFO L225 Difference]: With dead ends: 142 [2021-10-24 09:46:48,058 INFO L226 Difference]: Without dead ends: 128 [2021-10-24 09:46:48,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-10-24 09:46:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-24 09:46:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2021-10-24 09:46:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2021-10-24 09:46:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2021-10-24 09:46:48,073 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2021-10-24 09:46:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:48,074 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2021-10-24 09:46:48,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-10-24 09:46:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2021-10-24 09:46:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-24 09:46:48,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:48,078 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:48,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:48,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-24 09:46:48,285 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2021-10-24 09:46:48,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:48,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614037498] [2021-10-24 09:46:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:48,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2021-10-24 09:46:48,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:48,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614037498] [2021-10-24 09:46:48,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614037498] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:48,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256681447] [2021-10-24 09:46:48,570 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-24 09:46:48,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:48,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:48,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-24 09:46:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-24 09:46:49,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2021-10-24 09:46:49,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2021-10-24 09:46:51,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256681447] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:51,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335962430] [2021-10-24 09:46:51,883 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:51,883 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:51,883 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:608) 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-10-24 09:46:51,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:51,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 31 [2021-10-24 09:46:51,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246236435] [2021-10-24 09:46:51,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-24 09:46:51,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:51,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-24 09:46:51,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-10-24 09:46:51,887 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2021-10-24 09:46:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:46:53,224 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2021-10-24 09:46:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-24 09:46:53,225 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) Word has length 239 [2021-10-24 09:46:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:46:53,229 INFO L225 Difference]: With dead ends: 300 [2021-10-24 09:46:53,229 INFO L226 Difference]: Without dead ends: 182 [2021-10-24 09:46:53,232 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 466 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 796.4ms TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2021-10-24 09:46:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-24 09:46:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2021-10-24 09:46:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2021-10-24 09:46:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2021-10-24 09:46:53,249 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2021-10-24 09:46:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:46:53,250 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2021-10-24 09:46:53,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2021-10-24 09:46:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2021-10-24 09:46:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2021-10-24 09:46:53,274 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:46:53,274 INFO L512 BasicCegarLoop]: trace histogram [66, 66, 54, 53, 53, 45, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 12, 12, 8, 1, 1, 1, 1, 1, 1] [2021-10-24 09:46:53,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-24 09:46:53,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-24 09:46:53,491 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:46:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:46:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1043357236, now seen corresponding path program 5 times [2021-10-24 09:46:53,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:46:53,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222809862] [2021-10-24 09:46:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:46:53,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:46:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:46:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 279 proven. 1827 refuted. 0 times theorem prover too weak. 17819 trivial. 0 not checked. [2021-10-24 09:46:53,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:46:53,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222809862] [2021-10-24 09:46:53,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222809862] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:46:53,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20152546] [2021-10-24 09:46:53,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 09:46:53,936 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:46:53,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:46:53,939 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:46:53,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-24 09:46:54,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-24 09:46:54,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:46:54,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-24 09:46:54,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:46:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2021-10-24 09:46:56,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:46:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2021-10-24 09:46:59,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20152546] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:46:59,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [627078089] [2021-10-24 09:46:59,643 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:46:59,643 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:46:59,643 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:608) 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-10-24 09:46:59,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:46:59,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2021-10-24 09:46:59,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900054651] [2021-10-24 09:46:59,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-24 09:46:59,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:46:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-24 09:46:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-10-24 09:46:59,648 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-10-24 09:47:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:00,018 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2021-10-24 09:47:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-24 09:47:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 816 [2021-10-24 09:47:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:00,025 INFO L225 Difference]: With dead ends: 351 [2021-10-24 09:47:00,025 INFO L226 Difference]: Without dead ends: 202 [2021-10-24 09:47:00,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1659 GetRequests, 1629 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 226.2ms TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-10-24 09:47:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-24 09:47:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2021-10-24 09:47:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2021-10-24 09:47:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2021-10-24 09:47:00,058 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 816 [2021-10-24 09:47:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:00,059 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2021-10-24 09:47:00,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-10-24 09:47:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2021-10-24 09:47:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-10-24 09:47:00,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:00,071 INFO L512 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:00,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:00,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:00,287 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1333422328, now seen corresponding path program 6 times [2021-10-24 09:47:00,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:00,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173563137] [2021-10-24 09:47:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:00,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 294 proven. 759 refuted. 0 times theorem prover too weak. 5030 trivial. 0 not checked. [2021-10-24 09:47:00,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:00,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173563137] [2021-10-24 09:47:00,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173563137] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:00,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62023516] [2021-10-24 09:47:00,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-24 09:47:00,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:00,625 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:00,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-24 09:47:02,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-24 09:47:02,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:47:02,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-24 09:47:02,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 2733 proven. 170 refuted. 0 times theorem prover too weak. 3180 trivial. 0 not checked. [2021-10-24 09:47:03,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 319 proven. 1329 refuted. 0 times theorem prover too weak. 4435 trivial. 0 not checked. [2021-10-24 09:47:06,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62023516] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:06,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019997539] [2021-10-24 09:47:06,136 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:06,136 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:06,136 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:608) 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-10-24 09:47:06,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:06,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 32 [2021-10-24 09:47:06,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682233113] [2021-10-24 09:47:06,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-24 09:47:06,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-24 09:47:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2021-10-24 09:47:06,141 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2021-10-24 09:47:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:07,332 INFO L93 Difference]: Finished difference Result 467 states and 957 transitions. [2021-10-24 09:47:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-24 09:47:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) Word has length 459 [2021-10-24 09:47:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:07,338 INFO L225 Difference]: With dead ends: 467 [2021-10-24 09:47:07,338 INFO L226 Difference]: Without dead ends: 200 [2021-10-24 09:47:07,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 901 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 690.1ms TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2021-10-24 09:47:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-24 09:47:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2021-10-24 09:47:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 120 states have internal predecessors, (136), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (90), 35 states have call predecessors, (90), 33 states have call successors, (90) [2021-10-24 09:47:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2021-10-24 09:47:07,372 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 459 [2021-10-24 09:47:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:07,373 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2021-10-24 09:47:07,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2021-10-24 09:47:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2021-10-24 09:47:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2021-10-24 09:47:07,377 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:07,377 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 23, 22, 22, 18, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 6, 4, 2, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:07,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:07,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:07,591 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1703076480, now seen corresponding path program 7 times [2021-10-24 09:47:07,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:07,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879890357] [2021-10-24 09:47:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:07,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 242 proven. 432 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2021-10-24 09:47:07,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:07,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879890357] [2021-10-24 09:47:07,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879890357] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:07,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677056073] [2021-10-24 09:47:07,763 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-24 09:47:07,763 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:07,765 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:07,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-24 09:47:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:09,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-24 09:47:09,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 196 proven. 591 refuted. 0 times theorem prover too weak. 2227 trivial. 0 not checked. [2021-10-24 09:47:10,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 204 proven. 604 refuted. 0 times theorem prover too weak. 2206 trivial. 0 not checked. [2021-10-24 09:47:12,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677056073] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:12,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325399336] [2021-10-24 09:47:12,442 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:12,443 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:12,443 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:608) 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-10-24 09:47:12,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:12,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 28 [2021-10-24 09:47:12,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856136431] [2021-10-24 09:47:12,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-24 09:47:12,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-24 09:47:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-10-24 09:47:12,447 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2021-10-24 09:47:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:13,473 INFO L93 Difference]: Finished difference Result 540 states and 1014 transitions. [2021-10-24 09:47:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-24 09:47:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) Word has length 326 [2021-10-24 09:47:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:13,481 INFO L225 Difference]: With dead ends: 540 [2021-10-24 09:47:13,481 INFO L226 Difference]: Without dead ends: 295 [2021-10-24 09:47:13,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 637 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 581.8ms TimeCoverageRelationStatistics Valid=417, Invalid=2553, Unknown=0, NotChecked=0, Total=2970 [2021-10-24 09:47:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-24 09:47:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 240. [2021-10-24 09:47:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 166 states have (on average 1.0783132530120483) internal successors, (179), 159 states have internal predecessors, (179), 46 states have call successors, (46), 31 states have call predecessors, (46), 27 states have return successors, (137), 49 states have call predecessors, (137), 46 states have call successors, (137) [2021-10-24 09:47:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 362 transitions. [2021-10-24 09:47:13,522 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 362 transitions. Word has length 326 [2021-10-24 09:47:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:13,525 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 362 transitions. [2021-10-24 09:47:13,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2021-10-24 09:47:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 362 transitions. [2021-10-24 09:47:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2021-10-24 09:47:13,529 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:13,529 INFO L512 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 24, 21, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 11, 7, 5, 5, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:13,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:13,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:13,743 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1628347666, now seen corresponding path program 8 times [2021-10-24 09:47:13,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:13,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078668858] [2021-10-24 09:47:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:13,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 351 proven. 493 refuted. 0 times theorem prover too weak. 3242 trivial. 0 not checked. [2021-10-24 09:47:13,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:13,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078668858] [2021-10-24 09:47:13,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078668858] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:13,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017962651] [2021-10-24 09:47:13,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 09:47:13,961 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:13,963 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:13,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-24 09:47:15,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-24 09:47:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:47:15,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-24 09:47:15,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 564 proven. 92 refuted. 0 times theorem prover too weak. 3430 trivial. 0 not checked. [2021-10-24 09:47:16,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 566 proven. 100 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2021-10-24 09:47:18,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017962651] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:18,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778067951] [2021-10-24 09:47:18,075 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:18,075 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:18,076 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:608) 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-10-24 09:47:18,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:18,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 13] total 27 [2021-10-24 09:47:18,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002052124] [2021-10-24 09:47:18,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-24 09:47:18,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-24 09:47:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-10-24 09:47:18,080 INFO L87 Difference]: Start difference. First operand 240 states and 362 transitions. Second operand has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-10-24 09:47:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:18,917 INFO L93 Difference]: Finished difference Result 534 states and 887 transitions. [2021-10-24 09:47:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-24 09:47:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) Word has length 378 [2021-10-24 09:47:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:18,926 INFO L225 Difference]: With dead ends: 534 [2021-10-24 09:47:18,927 INFO L226 Difference]: Without dead ends: 259 [2021-10-24 09:47:18,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 529.9ms TimeCoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2021-10-24 09:47:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-24 09:47:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 226. [2021-10-24 09:47:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 158 states have (on average 1.0822784810126582) internal successors, (171), 151 states have internal predecessors, (171), 42 states have call successors, (42), 31 states have call predecessors, (42), 25 states have return successors, (101), 43 states have call predecessors, (101), 42 states have call successors, (101) [2021-10-24 09:47:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2021-10-24 09:47:18,953 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 378 [2021-10-24 09:47:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:18,954 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2021-10-24 09:47:18,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-10-24 09:47:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2021-10-24 09:47:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-10-24 09:47:18,959 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:18,960 INFO L512 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 32, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 13, 12, 7, 7, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:19,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:19,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:19,187 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 856245533, now seen corresponding path program 9 times [2021-10-24 09:47:19,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:19,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142182829] [2021-10-24 09:47:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:19,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8105 backedges. 361 proven. 608 refuted. 0 times theorem prover too weak. 7136 trivial. 0 not checked. [2021-10-24 09:47:19,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:19,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142182829] [2021-10-24 09:47:19,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142182829] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:19,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021446148] [2021-10-24 09:47:19,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-24 09:47:19,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:19,395 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:19,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-24 09:47:21,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-24 09:47:21,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:47:21,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-24 09:47:21,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8105 backedges. 4435 proven. 432 refuted. 0 times theorem prover too weak. 3238 trivial. 0 not checked. [2021-10-24 09:47:22,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8105 backedges. 445 proven. 1643 refuted. 0 times theorem prover too weak. 6017 trivial. 0 not checked. [2021-10-24 09:47:26,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021446148] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:26,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514308733] [2021-10-24 09:47:26,125 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:26,125 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:26,125 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:608) 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-10-24 09:47:26,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:26,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 23] total 31 [2021-10-24 09:47:26,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774647952] [2021-10-24 09:47:26,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-24 09:47:26,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-24 09:47:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2021-10-24 09:47:26,129 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) [2021-10-24 09:47:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:27,167 INFO L93 Difference]: Finished difference Result 412 states and 573 transitions. [2021-10-24 09:47:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-24 09:47:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) Word has length 528 [2021-10-24 09:47:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:27,171 INFO L225 Difference]: With dead ends: 412 [2021-10-24 09:47:27,171 INFO L226 Difference]: Without dead ends: 218 [2021-10-24 09:47:27,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 1036 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 720.5ms TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2021-10-24 09:47:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-10-24 09:47:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 181. [2021-10-24 09:47:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 124 states have internal predecessors, (136), 36 states have call successors, (36), 27 states have call predecessors, (36), 17 states have return successors, (50), 29 states have call predecessors, (50), 36 states have call successors, (50) [2021-10-24 09:47:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2021-10-24 09:47:27,190 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 528 [2021-10-24 09:47:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:27,192 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2021-10-24 09:47:27,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) [2021-10-24 09:47:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2021-10-24 09:47:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2021-10-24 09:47:27,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:27,198 INFO L512 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 38, 36, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 13, 11, 8, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:27,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:27,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-24 09:47:27,427 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash -933782193, now seen corresponding path program 10 times [2021-10-24 09:47:27,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:27,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59110568] [2021-10-24 09:47:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:27,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 574 proven. 929 refuted. 0 times theorem prover too weak. 10318 trivial. 0 not checked. [2021-10-24 09:47:27,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:27,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59110568] [2021-10-24 09:47:27,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59110568] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:27,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568697115] [2021-10-24 09:47:27,717 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-24 09:47:27,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:27,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:27,720 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:27,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-24 09:47:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:29,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-24 09:47:29,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 684 proven. 1198 refuted. 0 times theorem prover too weak. 9939 trivial. 0 not checked. [2021-10-24 09:47:31,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 684 proven. 1228 refuted. 0 times theorem prover too weak. 9909 trivial. 0 not checked. [2021-10-24 09:47:34,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568697115] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:34,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [99766069] [2021-10-24 09:47:34,779 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:34,779 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:34,780 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:608) 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-10-24 09:47:34,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:34,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2021-10-24 09:47:34,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211327631] [2021-10-24 09:47:34,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-24 09:47:34,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-24 09:47:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-10-24 09:47:34,785 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2021-10-24 09:47:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:35,123 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2021-10-24 09:47:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-24 09:47:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) Word has length 635 [2021-10-24 09:47:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:35,127 INFO L225 Difference]: With dead ends: 196 [2021-10-24 09:47:35,127 INFO L226 Difference]: Without dead ends: 181 [2021-10-24 09:47:35,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1293 GetRequests, 1260 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 266.1ms TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2021-10-24 09:47:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-10-24 09:47:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-10-24 09:47:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 124 states have internal predecessors, (136), 36 states have call successors, (36), 27 states have call predecessors, (36), 17 states have return successors, (46), 29 states have call predecessors, (46), 36 states have call successors, (46) [2021-10-24 09:47:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2021-10-24 09:47:35,150 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 635 [2021-10-24 09:47:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:35,151 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2021-10-24 09:47:35,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2021-10-24 09:47:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2021-10-24 09:47:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2021-10-24 09:47:35,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:35,157 INFO L512 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 25, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:35,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:35,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-10-24 09:47:35,374 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 717418268, now seen corresponding path program 11 times [2021-10-24 09:47:35,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:35,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329145716] [2021-10-24 09:47:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:35,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:47:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6031 backedges. 396 proven. 406 refuted. 0 times theorem prover too weak. 5229 trivial. 0 not checked. [2021-10-24 09:47:35,563 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:47:35,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329145716] [2021-10-24 09:47:35,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329145716] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:47:35,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754008759] [2021-10-24 09:47:35,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 09:47:35,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:47:35,565 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:47:35,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-24 09:47:38,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-10-24 09:47:38,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 09:47:38,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 09:47:38,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:47:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6031 backedges. 2021 proven. 6 refuted. 0 times theorem prover too weak. 4004 trivial. 0 not checked. [2021-10-24 09:47:38,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:47:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6031 backedges. 663 proven. 93 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2021-10-24 09:47:40,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754008759] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 09:47:40,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259083940] [2021-10-24 09:47:40,755 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-24 09:47:40,755 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 09:47:40,756 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:608) 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-10-24 09:47:40,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 09:47:40,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2021-10-24 09:47:40,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59447761] [2021-10-24 09:47:40,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-24 09:47:40,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:47:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-24 09:47:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-10-24 09:47:40,760 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 10 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2021-10-24 09:47:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:47:41,172 INFO L93 Difference]: Finished difference Result 351 states and 431 transitions. [2021-10-24 09:47:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-24 09:47:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 10 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 457 [2021-10-24 09:47:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:47:41,176 INFO L225 Difference]: With dead ends: 351 [2021-10-24 09:47:41,176 INFO L226 Difference]: Without dead ends: 200 [2021-10-24 09:47:41,178 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 907 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 261.1ms TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2021-10-24 09:47:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-24 09:47:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2021-10-24 09:47:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 125 states have (on average 1.072) internal successors, (134), 122 states have internal predecessors, (134), 36 states have call successors, (36), 27 states have call predecessors, (36), 16 states have return successors, (44), 28 states have call predecessors, (44), 36 states have call successors, (44) [2021-10-24 09:47:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2021-10-24 09:47:41,193 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 457 [2021-10-24 09:47:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:47:41,194 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2021-10-24 09:47:41,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 10 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2021-10-24 09:47:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2021-10-24 09:47:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-10-24 09:47:41,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:47:41,230 INFO L512 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2021-10-24 09:47:41,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-24 09:47:41,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:47:41,440 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:47:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:47:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1780384136, now seen corresponding path program 12 times [2021-10-24 09:47:41,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:47:41,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893737919] [2021-10-24 09:47:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:47:41,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:47:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 09:47:41,527 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-24 09:47:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 09:47:41,719 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-24 09:47:41,720 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-24 09:47:41,721 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 09:47:41,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-24 09:47:41,730 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 09:47:41,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:47:41 BoogieIcfgContainer [2021-10-24 09:47:41,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 09:47:41,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 09:47:41,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 09:47:41,925 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 09:47:41,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:46:27" (3/4) ... [2021-10-24 09:47:41,927 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-24 09:47:42,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 09:47:42,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 09:47:42,164 INFO L168 Benchmark]: Toolchain (without parser) took 75216.57 ms. Allocated memory was 100.7 MB in the beginning and 474.0 MB in the end (delta: 373.3 MB). Free memory was 67.8 MB in the beginning and 200.6 MB in the end (delta: -132.7 MB). Peak memory consumption was 376.5 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,164 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 09:47:42,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.16 ms. Allocated memory is still 100.7 MB. Free memory was 67.7 MB in the beginning and 77.1 MB in the end (delta: -9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.64 ms. Allocated memory is still 100.7 MB. Free memory was 77.1 MB in the beginning and 75.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,165 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 ms. Allocated memory is still 100.7 MB. Free memory was 75.8 MB in the beginning and 74.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 09:47:42,166 INFO L168 Benchmark]: RCFGBuilder took 400.81 ms. Allocated memory is still 100.7 MB. Free memory was 74.8 MB in the beginning and 64.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,166 INFO L168 Benchmark]: TraceAbstraction took 74233.55 ms. Allocated memory was 100.7 MB in the beginning and 474.0 MB in the end (delta: 373.3 MB). Free memory was 63.9 MB in the beginning and 123.5 MB in the end (delta: -59.6 MB). Peak memory consumption was 316.9 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,166 INFO L168 Benchmark]: Witness Printer took 238.49 ms. Allocated memory is still 474.0 MB. Free memory was 123.5 MB in the beginning and 201.5 MB in the end (delta: -78.0 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. [2021-10-24 09:47:42,168 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.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 276.16 ms. Allocated memory is still 100.7 MB. Free memory was 67.7 MB in the beginning and 77.1 MB in the end (delta: -9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.64 ms. Allocated memory is still 100.7 MB. Free memory was 77.1 MB in the beginning and 75.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.24 ms. Allocated memory is still 100.7 MB. Free memory was 75.8 MB in the beginning and 74.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 400.81 ms. Allocated memory is still 100.7 MB. Free memory was 74.8 MB in the beginning and 64.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 74233.55 ms. Allocated memory was 100.7 MB in the beginning and 474.0 MB in the end (delta: 373.3 MB). Free memory was 63.9 MB in the beginning and 123.5 MB in the end (delta: -59.6 MB). Peak memory consumption was 316.9 MB. Max. memory is 16.1 GB. * Witness Printer took 238.49 ms. Allocated memory is still 474.0 MB. Free memory was 123.5 MB in the beginning and 201.5 MB in the end (delta: -78.0 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 21 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73963.3ms, OverallIterations: 20, TraceHistogramMax: 66, EmptinessCheckTime: 139.7ms, AutomataDifference: 9668.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 564 SDtfs, 1694 SDslu, 4810 SDs, 0 SdLazy, 8629 SolverSat, 1961 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4500.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9849 GetRequests, 9230 SyntacticMatches, 32 SemanticMatches, 587 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4848 ImplicationChecksByTransitivity, 6705.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=15, InterpolantAutomatonStates: 393, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 397.8ms AutomataMinimizationTime, 19 MinimizatonAttempts, 326 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 428.1ms SsaConstructionTime, 1702.0ms SatisfiabilityAnalysisTime, 41609.9ms InterpolantComputationTime, 9844 NumberOfCodeBlocks, 8235 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 14015 ConstructedInterpolants, 0 QuantifiedInterpolants, 18735 SizeOfPredicates, 86 NumberOfNonLiveVariables, 7147 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 174001/190530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 420, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME[ms]: 196, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME[ms]: 73, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 33, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME[ms]: 291, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 191, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 44, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 21, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 86, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 86, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 12, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-24 09:47:42,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_755b7879-1abd-4d70-bd05-c2c5ff882a9d/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...