./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/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_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG --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-b2eff8b [2021-10-29 05:48:05,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:48:05,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:48:05,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:48:05,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:48:05,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:48:05,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:48:05,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:48:05,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:48:05,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:48:05,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:48:05,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:48:05,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:48:05,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:48:05,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:48:05,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:48:05,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:48:05,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:48:05,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:48:05,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:48:05,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:48:05,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:48:05,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:48:05,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:48:05,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:48:05,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:48:05,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:48:05,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:48:05,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:48:05,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:48:05,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:48:05,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:48:05,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:48:05,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:48:05,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:48:05,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:48:05,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:48:05,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:48:05,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:48:05,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:48:05,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:48:05,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:48:05,899 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:48:05,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:48:05,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:48:05,901 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:48:05,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:48:05,902 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:48:05,902 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:48:05,902 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:48:05,902 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:48:05,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:48:05,904 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:48:05,904 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:48:05,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:48:05,905 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:48:05,905 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:48:05,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:48:05,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:48:05,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:48:05,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:48:05,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:48:05,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:48:05,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:48:05,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:48:05,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:48:05,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:48:05,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:48:05,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:48:05,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:48:05,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:48:05,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:48:05,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:48:05,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:48:05,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:48:05,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:48:05,911 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:48:05,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:48:05,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:48:05,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:48:05,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:48:05,912 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_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/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_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG 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-29 05:48:06,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:48:06,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:48:06,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:48:06,244 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:48:06,245 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:48:06,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-10-29 05:48:06,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/data/0bca50e43/b64bb55b1bed42598e10faba5a48df92/FLAG1faa17724 [2021-10-29 05:48:06,905 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:48:06,905 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-10-29 05:48:06,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/data/0bca50e43/b64bb55b1bed42598e10faba5a48df92/FLAG1faa17724 [2021-10-29 05:48:07,283 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/data/0bca50e43/b64bb55b1bed42598e10faba5a48df92 [2021-10-29 05:48:07,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:48:07,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:48:07,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:48:07,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:48:07,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:48:07,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428ce67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07, skipping insertion in model container [2021-10-29 05:48:07,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:48:07,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:48:07,518 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_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-10-29 05:48:07,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:48:07,532 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:48:07,550 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_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-10-29 05:48:07,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:48:07,565 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:48:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07 WrapperNode [2021-10-29 05:48:07,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:48:07,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:48:07,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:48:07,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:48:07,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:48:07,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:48:07,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:48:07,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:48:07,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:48:07,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:48:07,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:48:07,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:48:07,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (1/1) ... [2021-10-29 05:48:07,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:48:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:07,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:48:07,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:48:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:48:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-10-29 05:48:07,721 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-10-29 05:48:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:48:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-10-29 05:48:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-10-29 05:48:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:48:07,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:48:08,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:48:08,039 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-29 05:48:08,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:48:08 BoogieIcfgContainer [2021-10-29 05:48:08,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:48:08,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:48:08,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:48:08,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:48:08,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:48:07" (1/3) ... [2021-10-29 05:48:08,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d809ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:48:08, skipping insertion in model container [2021-10-29 05:48:08,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:48:07" (2/3) ... [2021-10-29 05:48:08,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d809ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:48:08, skipping insertion in model container [2021-10-29 05:48:08,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:48:08" (3/3) ... [2021-10-29 05:48:08,052 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-10-29 05:48:08,069 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:48:08,070 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 05:48:08,159 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:48:08,170 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-29 05:48:08,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 05:48:08,193 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-29 05:48:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:48:08,201 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:08,202 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:08,202 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2021-10-29 05:48:08,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:08,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215667802] [2021-10-29 05:48:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:08,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:08,502 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-29 05:48:08,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:08,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215667802] [2021-10-29 05:48:08,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215667802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:48:08,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:48:08,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:48:08,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502201325] [2021-10-29 05:48:08,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:48:08,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:48:08,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:48:08,538 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-29 05:48:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:08,609 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-10-29 05:48:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:48:08,612 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-29 05:48:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:08,623 INFO L225 Difference]: With dead ends: 36 [2021-10-29 05:48:08,623 INFO L226 Difference]: Without dead ends: 26 [2021-10-29 05:48:08,628 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:48:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-29 05:48:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-29 05:48:08,682 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-29 05:48:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-29 05:48:08,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-10-29 05:48:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:08,689 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-29 05:48:08,689 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-29 05:48:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-29 05:48:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:48:08,692 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:08,693 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:08,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:48:08,695 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2021-10-29 05:48:08,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:08,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319927360] [2021-10-29 05:48:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:08,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:08,790 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-29 05:48:08,791 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:08,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319927360] [2021-10-29 05:48:08,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319927360] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:48:08,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:48:08,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:48:08,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609688752] [2021-10-29 05:48:08,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:48:08,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:48:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:48:08,796 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-29 05:48:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:08,815 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-10-29 05:48:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:48:08,816 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-29 05:48:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:08,817 INFO L225 Difference]: With dead ends: 32 [2021-10-29 05:48:08,818 INFO L226 Difference]: Without dead ends: 28 [2021-10-29 05:48:08,819 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:48:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-29 05:48:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-10-29 05:48:08,825 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-29 05:48:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-29 05:48:08,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-10-29 05:48:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:08,827 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-29 05:48:08,828 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-29 05:48:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-29 05:48:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:48:08,830 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:08,830 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:08,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:48:08,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:08,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2021-10-29 05:48:08,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:08,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318667385] [2021-10-29 05:48:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:08,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:08,904 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-29 05:48:08,905 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:08,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318667385] [2021-10-29 05:48:08,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318667385] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:08,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312764647] [2021-10-29 05:48:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:08,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:08,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:08,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 05:48:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:09,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:48:09,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:09,277 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-29 05:48:09,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:09,676 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-29 05:48:09,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312764647] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:09,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1402752621] [2021-10-29 05:48:09,701 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-29 05:48:09,702 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:09,707 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-29 05:48:09,713 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-29 05:48:09,714 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-29 05:48:09,756 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,763 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-29 05:48:09,778 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,785 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-29 05:48:09,786 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-29 05:48:09,787 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,788 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-29 05:48:09,791 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 122 [2021-10-29 05:48:09,811 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_9|], 21=[|v_#valid_10|]} [2021-10-29 05:48:09,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,847 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-29 05:48:09,850 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,851 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-29 05:48:09,854 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,855 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-29 05:48:09,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-29 05:48:09,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:09,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 05:48:09,982 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-29 05:48:09,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,989 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-10-29 05:48:09,990 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:09,991 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-10-29 05:48:09,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-29 05:48:09,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:10,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,022 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,025 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-29 05:48:10,026 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:94 [2021-10-29 05:48:10,032 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,036 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,052 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,054 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-10-29 05:48:10,063 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,067 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-10-29 05:48:10,070 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,074 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-10-29 05:48:10,079 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,089 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-10-29 05:48:10,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:10,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:10,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:10,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:48:10,135 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,141 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,151 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,159 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,160 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 57 for LOIs [2021-10-29 05:48:10,177 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,185 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,194 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,200 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-10-29 05:48:10,206 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,212 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,218 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,229 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-10-29 05:48:10,236 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 05:48:10,241 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-10-29 05:48:10,243 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 57 for LOIs [2021-10-29 05:48:10,249 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-29 05:48:11,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1402752621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:48:11,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:11,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2021-10-29 05:48:11,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541176930] [2021-10-29 05:48:11,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:48:11,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:48:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:48:11,059 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-29 05:48:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:11,258 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-10-29 05:48:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:48:11,259 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-29 05:48:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:11,260 INFO L225 Difference]: With dead ends: 68 [2021-10-29 05:48:11,261 INFO L226 Difference]: Without dead ends: 44 [2021-10-29 05:48:11,262 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:48:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-29 05:48:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-10-29 05:48:11,271 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-29 05:48:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-10-29 05:48:11,277 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2021-10-29 05:48:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:11,278 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-10-29 05:48:11,279 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-29 05:48:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2021-10-29 05:48:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 05:48:11,286 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:11,286 INFO L513 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-29 05:48:11,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-29 05:48:11,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:11,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2021-10-29 05:48:11,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:11,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159729729] [2021-10-29 05:48:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:11,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:11,621 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-29 05:48:11,621 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:11,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159729729] [2021-10-29 05:48:11,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159729729] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:11,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516239939] [2021-10-29 05:48:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:11,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:11,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:11,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 05:48:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:11,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:48:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:11,941 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-29 05:48:11,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:12,410 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-29 05:48:12,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516239939] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:12,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806477491] [2021-10-29 05:48:12,416 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:12,417 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:12,419 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:609) 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-29 05:48:12,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:12,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-10-29 05:48:12,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426528784] [2021-10-29 05:48:12,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-29 05:48:12,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-29 05:48:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:48:12,426 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-29 05:48:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:12,657 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2021-10-29 05:48:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:48:12,658 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-29 05:48:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:12,669 INFO L225 Difference]: With dead ends: 85 [2021-10-29 05:48:12,669 INFO L226 Difference]: Without dead ends: 53 [2021-10-29 05:48:12,671 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-10-29 05:48:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-29 05:48:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-10-29 05:48:12,696 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-29 05:48:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-10-29 05:48:12,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2021-10-29 05:48:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:12,702 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-10-29 05:48:12,703 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-29 05:48:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-10-29 05:48:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:48:12,712 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:12,713 INFO L513 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-29 05:48:12,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:12,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-29 05:48:12,928 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2021-10-29 05:48:12,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:12,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331626644] [2021-10-29 05:48:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:12,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:13,060 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-29 05:48:13,061 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:13,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331626644] [2021-10-29 05:48:13,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331626644] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:13,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101943531] [2021-10-29 05:48:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:13,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:13,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:13,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 05:48:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:13,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:48:13,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:13,355 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-29 05:48:13,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:13,798 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-29 05:48:13,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101943531] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:13,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [791434427] [2021-10-29 05:48:13,808 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:13,808 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:13,809 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:609) 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-29 05:48:13,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:13,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-10-29 05:48:13,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083097776] [2021-10-29 05:48:13,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-29 05:48:13,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:13,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-29 05:48:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-10-29 05:48:13,814 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-29 05:48:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:14,390 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2021-10-29 05:48:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-29 05:48:14,391 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-29 05:48:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:14,394 INFO L225 Difference]: With dead ends: 121 [2021-10-29 05:48:14,394 INFO L226 Difference]: Without dead ends: 77 [2021-10-29 05:48:14,396 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-10-29 05:48:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-29 05:48:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-10-29 05:48:14,413 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-29 05:48:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2021-10-29 05:48:14,415 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2021-10-29 05:48:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:14,415 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2021-10-29 05:48:14,416 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-29 05:48:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2021-10-29 05:48:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-29 05:48:14,419 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:14,419 INFO L513 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-29 05:48:14,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:14,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-29 05:48:14,632 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2021-10-29 05:48:14,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:14,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554833803] [2021-10-29 05:48:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:14,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:14,755 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-29 05:48:14,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:14,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554833803] [2021-10-29 05:48:14,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554833803] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:14,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374713014] [2021-10-29 05:48:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:14,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:14,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:14,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 05:48:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-29 05:48:14,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:15,095 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-29 05:48:15,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:15,711 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-29 05:48:15,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374713014] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:15,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829023145] [2021-10-29 05:48:15,715 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:15,715 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:15,716 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:609) 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-29 05:48:15,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:15,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2021-10-29 05:48:15,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167993381] [2021-10-29 05:48:15,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-29 05:48:15,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:15,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-29 05:48:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:48:15,720 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-29 05:48:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:15,952 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2021-10-29 05:48:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 05:48:15,953 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-29 05:48:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:15,955 INFO L225 Difference]: With dead ends: 119 [2021-10-29 05:48:15,955 INFO L226 Difference]: Without dead ends: 97 [2021-10-29 05:48:15,956 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-29 05:48:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-29 05:48:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2021-10-29 05:48:15,973 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-29 05:48:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2021-10-29 05:48:15,975 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2021-10-29 05:48:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:15,976 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2021-10-29 05:48:15,976 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-29 05:48:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2021-10-29 05:48:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-29 05:48:15,979 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:15,979 INFO L513 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-29 05:48:16,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:16,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-29 05:48:16,192 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2021-10-29 05:48:16,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:16,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769781587] [2021-10-29 05:48:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:16,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:16,380 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-29 05:48:16,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:16,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769781587] [2021-10-29 05:48:16,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769781587] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:16,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208829807] [2021-10-29 05:48:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:16,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:16,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:16,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-29 05:48:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:16,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-29 05:48:16,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:16,835 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-29 05:48:16,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:17,776 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-29 05:48:17,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208829807] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:17,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [128415131] [2021-10-29 05:48:17,779 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:17,780 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:17,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:609) 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-29 05:48:17,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:17,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-10-29 05:48:17,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775891017] [2021-10-29 05:48:17,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 05:48:17,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 05:48:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-10-29 05:48:17,783 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-29 05:48:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:18,576 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2021-10-29 05:48:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-29 05:48:18,577 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-29 05:48:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:18,580 INFO L225 Difference]: With dead ends: 204 [2021-10-29 05:48:18,581 INFO L226 Difference]: Without dead ends: 115 [2021-10-29 05:48:18,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-10-29 05:48:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-29 05:48:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2021-10-29 05:48:18,618 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-29 05:48:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2021-10-29 05:48:18,623 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2021-10-29 05:48:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:18,627 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2021-10-29 05:48:18,629 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-29 05:48:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2021-10-29 05:48:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-29 05:48:18,635 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:18,635 INFO L513 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-29 05:48:18,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:18,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-29 05:48:18,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2021-10-29 05:48:18,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:18,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108562244] [2021-10-29 05:48:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:18,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:18,968 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-29 05:48:18,968 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:18,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108562244] [2021-10-29 05:48:18,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108562244] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:18,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982739523] [2021-10-29 05:48:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:18,969 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:18,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:18,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-29 05:48:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:19,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 05:48:19,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:19,770 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-29 05:48:19,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:21,226 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-29 05:48:21,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982739523] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:21,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1816799483] [2021-10-29 05:48:21,229 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:21,230 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:21,230 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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:609) 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-29 05:48:21,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:21,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2021-10-29 05:48:21,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226405052] [2021-10-29 05:48:21,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-29 05:48:21,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:21,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-29 05:48:21,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-10-29 05:48:21,234 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-29 05:48:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:21,519 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2021-10-29 05:48:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 05:48:21,520 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-29 05:48:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:21,522 INFO L225 Difference]: With dead ends: 191 [2021-10-29 05:48:21,522 INFO L226 Difference]: Without dead ends: 103 [2021-10-29 05:48:21,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-10-29 05:48:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-29 05:48:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-10-29 05:48:21,535 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-29 05:48:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2021-10-29 05:48:21,537 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2021-10-29 05:48:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:21,537 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2021-10-29 05:48:21,537 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-29 05:48:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2021-10-29 05:48:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-29 05:48:21,540 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:21,540 INFO L513 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-29 05:48:21,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:21,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-29 05:48:21,751 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2021-10-29 05:48:21,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:21,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754442993] [2021-10-29 05:48:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:21,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:21,877 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-29 05:48:21,878 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:21,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754442993] [2021-10-29 05:48:21,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754442993] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:21,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84644583] [2021-10-29 05:48:21,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:48:21,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:21,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:21,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-29 05:48:22,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-29 05:48:22,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:48:22,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:48:22,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:22,470 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-29 05:48:22,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:23,120 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-29 05:48:23,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84644583] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:23,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478819606] [2021-10-29 05:48:23,126 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:23,127 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:23,127 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:609) 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-29 05:48:23,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:23,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2021-10-29 05:48:23,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004382634] [2021-10-29 05:48:23,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-29 05:48:23,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-29 05:48:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-10-29 05:48:23,134 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-29 05:48:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:23,368 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2021-10-29 05:48:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 05:48:23,368 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-29 05:48:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:23,370 INFO L225 Difference]: With dead ends: 132 [2021-10-29 05:48:23,370 INFO L226 Difference]: Without dead ends: 118 [2021-10-29 05:48:23,371 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-29 05:48:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-29 05:48:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-10-29 05:48:23,385 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-29 05:48:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-10-29 05:48:23,388 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2021-10-29 05:48:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:23,389 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-10-29 05:48:23,389 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-29 05:48:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-10-29 05:48:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 05:48:23,392 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:23,392 INFO L513 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-29 05:48:23,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:23,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:23,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2021-10-29 05:48:23,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:23,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673152195] [2021-10-29 05:48:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:23,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:23,785 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-29 05:48:23,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:23,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673152195] [2021-10-29 05:48:23,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673152195] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:23,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348276357] [2021-10-29 05:48:23,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:48:23,786 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:23,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:23,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-29 05:48:24,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:48:24,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:48:24,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-29 05:48:24,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:24,621 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-29 05:48:24,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:25,772 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-29 05:48:25,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348276357] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:25,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342008707] [2021-10-29 05:48:25,775 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:25,776 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:25,776 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:609) 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-29 05:48:25,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:25,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2021-10-29 05:48:25,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899563440] [2021-10-29 05:48:25,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-29 05:48:25,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-29 05:48:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:48:25,779 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-29 05:48:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:26,018 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2021-10-29 05:48:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 05:48:26,019 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-29 05:48:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:26,022 INFO L225 Difference]: With dead ends: 213 [2021-10-29 05:48:26,022 INFO L226 Difference]: Without dead ends: 113 [2021-10-29 05:48:26,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-29 05:48:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-29 05:48:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-10-29 05:48:26,039 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-29 05:48:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2021-10-29 05:48:26,041 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2021-10-29 05:48:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:26,042 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-10-29 05:48:26,042 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-29 05:48:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2021-10-29 05:48:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-10-29 05:48:26,048 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:26,048 INFO L513 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-29 05:48:26,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:26,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-29 05:48:26,272 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2021-10-29 05:48:26,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:26,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417862801] [2021-10-29 05:48:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:26,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:26,414 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-29 05:48:26,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:26,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417862801] [2021-10-29 05:48:26,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417862801] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:26,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156816022] [2021-10-29 05:48:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:26,415 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:26,421 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:26,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-29 05:48:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:27,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 05:48:27,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:27,502 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-29 05:48:27,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:29,062 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-29 05:48:29,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156816022] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:29,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882476558] [2021-10-29 05:48:29,065 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:29,065 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:29,065 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:609) 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-29 05:48:29,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:29,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2021-10-29 05:48:29,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502184726] [2021-10-29 05:48:29,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-29 05:48:29,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-29 05:48:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-10-29 05:48:29,068 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-29 05:48:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:29,288 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2021-10-29 05:48:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:48:29,289 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-29 05:48:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:29,291 INFO L225 Difference]: With dead ends: 142 [2021-10-29 05:48:29,292 INFO L226 Difference]: Without dead ends: 128 [2021-10-29 05:48:29,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-10-29 05:48:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-29 05:48:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2021-10-29 05:48:29,304 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-29 05:48:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2021-10-29 05:48:29,306 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2021-10-29 05:48:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:29,307 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2021-10-29 05:48:29,307 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-29 05:48:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2021-10-29 05:48:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-29 05:48:29,311 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:29,311 INFO L513 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-29 05:48:29,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:29,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-29 05:48:29,528 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2021-10-29 05:48:29,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:29,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793074887] [2021-10-29 05:48:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:29,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:29,807 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-29 05:48:29,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:29,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793074887] [2021-10-29 05:48:29,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793074887] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:29,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651298238] [2021-10-29 05:48:29,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:48:29,808 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:29,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:29,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-29 05:48:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:30,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-29 05:48:30,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:31,229 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-29 05:48:31,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:33,211 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-29 05:48:33,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651298238] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:33,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924604753] [2021-10-29 05:48:33,223 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:33,223 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:33,224 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:609) 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-29 05:48:33,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:33,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 31 [2021-10-29 05:48:33,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063833417] [2021-10-29 05:48:33,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-29 05:48:33,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-29 05:48:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-10-29 05:48:33,229 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-29 05:48:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:34,735 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2021-10-29 05:48:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-29 05:48:34,735 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-29 05:48:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:34,740 INFO L225 Difference]: With dead ends: 300 [2021-10-29 05:48:34,740 INFO L226 Difference]: Without dead ends: 182 [2021-10-29 05:48:34,745 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 466 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2021-10-29 05:48:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-29 05:48:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2021-10-29 05:48:34,760 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-29 05:48:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2021-10-29 05:48:34,763 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2021-10-29 05:48:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:34,764 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2021-10-29 05:48:34,764 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-29 05:48:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2021-10-29 05:48:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2021-10-29 05:48:34,805 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:34,806 INFO L513 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-29 05:48:34,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:35,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-29 05:48:35,032 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1043357236, now seen corresponding path program 5 times [2021-10-29 05:48:35,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:35,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705082552] [2021-10-29 05:48:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:35,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:35,474 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-29 05:48:35,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:35,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705082552] [2021-10-29 05:48:35,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705082552] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:35,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365442404] [2021-10-29 05:48:35,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:48:35,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:35,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:35,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-29 05:48:36,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-29 05:48:36,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:48:36,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:48:36,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:37,936 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-29 05:48:37,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:41,403 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-29 05:48:41,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365442404] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:41,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2014489765] [2021-10-29 05:48:41,406 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:41,406 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:41,407 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:609) 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-29 05:48:41,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:41,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2021-10-29 05:48:41,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976873941] [2021-10-29 05:48:41,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-29 05:48:41,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-29 05:48:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-10-29 05:48:41,413 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-29 05:48:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:41,760 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2021-10-29 05:48:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-29 05:48:41,761 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-29 05:48:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:41,764 INFO L225 Difference]: With dead ends: 351 [2021-10-29 05:48:41,764 INFO L226 Difference]: Without dead ends: 202 [2021-10-29 05:48:41,766 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1659 GetRequests, 1629 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-10-29 05:48:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-29 05:48:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2021-10-29 05:48:41,789 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-29 05:48:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2021-10-29 05:48:41,792 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 816 [2021-10-29 05:48:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:41,793 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2021-10-29 05:48:41,793 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-29 05:48:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2021-10-29 05:48:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2021-10-29 05:48:41,835 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:41,835 INFO L513 BasicCegarLoop]: trace histogram [53, 53, 50, 50, 45, 42, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 20, 16, 8, 8, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:41,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:42,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:42,052 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -905773772, now seen corresponding path program 6 times [2021-10-29 05:48:42,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:42,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266283062] [2021-10-29 05:48:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:42,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14763 backedges. 590 proven. 1102 refuted. 0 times theorem prover too weak. 13071 trivial. 0 not checked. [2021-10-29 05:48:42,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:42,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266283062] [2021-10-29 05:48:42,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266283062] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:42,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947434196] [2021-10-29 05:48:42,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:48:42,409 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:42,410 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:42,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-29 05:48:43,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:48:43,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:48:43,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-29 05:48:43,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14763 backedges. 2859 proven. 32 refuted. 0 times theorem prover too weak. 11872 trivial. 0 not checked. [2021-10-29 05:48:45,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14763 backedges. 315 proven. 1718 refuted. 0 times theorem prover too weak. 12730 trivial. 0 not checked. [2021-10-29 05:48:48,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947434196] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:48,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [752002237] [2021-10-29 05:48:48,515 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:48,515 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:48,516 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:609) 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-29 05:48:48,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:48,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 27 [2021-10-29 05:48:48,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570055887] [2021-10-29 05:48:48,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-29 05:48:48,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-29 05:48:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-10-29 05:48:48,534 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 17 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2021-10-29 05:48:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:49,653 INFO L93 Difference]: Finished difference Result 438 states and 859 transitions. [2021-10-29 05:48:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-29 05:48:49,654 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 17 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 708 [2021-10-29 05:48:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:49,661 INFO L225 Difference]: With dead ends: 438 [2021-10-29 05:48:49,661 INFO L226 Difference]: Without dead ends: 200 [2021-10-29 05:48:49,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1404 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2021-10-29 05:48:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-29 05:48:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2021-10-29 05:48:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 122 states have (on average 1.0655737704918034) internal successors, (130), 119 states have internal predecessors, (130), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (97), 39 states have call predecessors, (97), 36 states have call successors, (97) [2021-10-29 05:48:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 263 transitions. [2021-10-29 05:48:49,693 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 263 transitions. Word has length 708 [2021-10-29 05:48:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:49,694 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 263 transitions. [2021-10-29 05:48:49,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 17 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2021-10-29 05:48:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 263 transitions. [2021-10-29 05:48:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2021-10-29 05:48:49,699 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:49,700 INFO L513 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 29, 26, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 11, 11, 8, 7, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:49,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:49,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:49,916 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1970353971, now seen corresponding path program 7 times [2021-10-29 05:48:49,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:49,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56570734] [2021-10-29 05:48:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:49,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 393 proven. 751 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2021-10-29 05:48:50,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:50,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56570734] [2021-10-29 05:48:50,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56570734] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:50,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857175759] [2021-10-29 05:48:50,284 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:48:50,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:50,285 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:50,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-29 05:48:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:52,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-29 05:48:52,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 455 proven. 971 refuted. 0 times theorem prover too weak. 5713 trivial. 0 not checked. [2021-10-29 05:48:53,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:48:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 457 proven. 999 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2021-10-29 05:48:56,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857175759] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:48:56,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [750311297] [2021-10-29 05:48:56,421 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:48:56,421 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:48:56,422 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:609) 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-29 05:48:56,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:48:56,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2021-10-29 05:48:56,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452600499] [2021-10-29 05:48:56,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 05:48:56,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:48:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 05:48:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-10-29 05:48:56,426 INFO L87 Difference]: Start difference. First operand 180 states and 263 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) [2021-10-29 05:48:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:48:56,746 INFO L93 Difference]: Finished difference Result 212 states and 319 transitions. [2021-10-29 05:48:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 05:48:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) Word has length 496 [2021-10-29 05:48:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:48:56,750 INFO L225 Difference]: With dead ends: 212 [2021-10-29 05:48:56,750 INFO L226 Difference]: Without dead ends: 172 [2021-10-29 05:48:56,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 982 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2021-10-29 05:48:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-29 05:48:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2021-10-29 05:48:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 115 states have (on average 1.0695652173913044) internal successors, (123), 112 states have internal predecessors, (123), 33 states have call successors, (33), 20 states have call predecessors, (33), 20 states have return successors, (71), 36 states have call predecessors, (71), 33 states have call successors, (71) [2021-10-29 05:48:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2021-10-29 05:48:56,768 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 496 [2021-10-29 05:48:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:48:56,769 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2021-10-29 05:48:56,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) [2021-10-29 05:48:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2021-10-29 05:48:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-10-29 05:48:56,773 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:48:56,773 INFO L513 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 21, 20, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 9, 7, 6, 4, 1, 1, 1, 1, 1, 1] [2021-10-29 05:48:56,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-29 05:48:56,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-10-29 05:48:56,988 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:48:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:48:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1288146810, now seen corresponding path program 8 times [2021-10-29 05:48:56,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:48:56,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359672972] [2021-10-29 05:48:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:48:56,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:48:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:48:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 330 proven. 288 refuted. 0 times theorem prover too weak. 2866 trivial. 0 not checked. [2021-10-29 05:48:57,166 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:48:57,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359672972] [2021-10-29 05:48:57,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359672972] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:48:57,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517620611] [2021-10-29 05:48:57,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:48:57,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:48:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:48:57,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:48:57,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-29 05:48:59,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-29 05:48:59,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:48:59,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-29 05:48:59,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:48:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 516 proven. 86 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2021-10-29 05:48:59,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:49:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 518 proven. 94 refuted. 0 times theorem prover too weak. 2872 trivial. 0 not checked. [2021-10-29 05:49:01,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517620611] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:49:01,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279837188] [2021-10-29 05:49:01,619 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:49:01,619 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:49:01,619 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:609) 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-29 05:49:01,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:49:01,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 19 [2021-10-29 05:49:01,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945505662] [2021-10-29 05:49:01,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-29 05:49:01,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:49:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-29 05:49:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-10-29 05:49:01,624 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) [2021-10-29 05:49:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:49:01,898 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2021-10-29 05:49:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 05:49:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) Word has length 350 [2021-10-29 05:49:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:49:01,902 INFO L225 Difference]: With dead ends: 202 [2021-10-29 05:49:01,902 INFO L226 Difference]: Without dead ends: 185 [2021-10-29 05:49:01,903 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2021-10-29 05:49:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-29 05:49:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2021-10-29 05:49:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 119 states have (on average 1.0672268907563025) internal successors, (127), 116 states have internal predecessors, (127), 33 states have call successors, (33), 20 states have call predecessors, (33), 22 states have return successors, (65), 38 states have call predecessors, (65), 33 states have call successors, (65) [2021-10-29 05:49:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2021-10-29 05:49:01,921 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 350 [2021-10-29 05:49:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:49:01,922 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2021-10-29 05:49:01,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 11 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) [2021-10-29 05:49:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2021-10-29 05:49:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2021-10-29 05:49:01,928 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:49:01,928 INFO L513 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 36, 34, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 14, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2021-10-29 05:49:01,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-29 05:49:02,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:49:02,144 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:49:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:49:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash 729546302, now seen corresponding path program 9 times [2021-10-29 05:49:02,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:49:02,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623289215] [2021-10-29 05:49:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:49:02,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:49:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:49:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11227 backedges. 338 proven. 1123 refuted. 0 times theorem prover too weak. 9766 trivial. 0 not checked. [2021-10-29 05:49:02,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:49:02,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623289215] [2021-10-29 05:49:02,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623289215] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:49:02,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468166638] [2021-10-29 05:49:02,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:49:02,451 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:49:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:49:02,452 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:49:02,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-29 05:49:04,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:49:04,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:49:04,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-29 05:49:04,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:49:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11227 backedges. 4046 proven. 166 refuted. 0 times theorem prover too weak. 7015 trivial. 0 not checked. [2021-10-29 05:49:06,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:49:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11227 backedges. 363 proven. 1949 refuted. 0 times theorem prover too weak. 8915 trivial. 0 not checked. [2021-10-29 05:49:10,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468166638] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:49:10,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1345823069] [2021-10-29 05:49:10,062 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:49:10,062 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:49:10,062 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:609) 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-29 05:49:10,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:49:10,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 32 [2021-10-29 05:49:10,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590963735] [2021-10-29 05:49:10,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-29 05:49:10,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:49:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-29 05:49:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2021-10-29 05:49:10,068 INFO L87 Difference]: Start difference. First operand 175 states and 225 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-29 05:49:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:49:10,991 INFO L93 Difference]: Finished difference Result 379 states and 525 transitions. [2021-10-29 05:49:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-29 05:49:10,992 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 619 [2021-10-29 05:49:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:49:10,995 INFO L225 Difference]: With dead ends: 379 [2021-10-29 05:49:10,995 INFO L226 Difference]: Without dead ends: 205 [2021-10-29 05:49:10,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1221 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2021-10-29 05:49:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-10-29 05:49:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2021-10-29 05:49:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.0769230769230769) internal successors, (140), 124 states have internal predecessors, (140), 34 states have call successors, (34), 25 states have call predecessors, (34), 21 states have return successors, (55), 36 states have call predecessors, (55), 34 states have call successors, (55) [2021-10-29 05:49:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2021-10-29 05:49:11,015 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 619 [2021-10-29 05:49:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:49:11,016 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2021-10-29 05:49:11,016 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-29 05:49:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2021-10-29 05:49:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2021-10-29 05:49:11,021 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:49:11,021 INFO L513 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1] [2021-10-29 05:49:11,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-29 05:49:11,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-29 05:49:11,240 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:49:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:49:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 111580103, now seen corresponding path program 10 times [2021-10-29 05:49:11,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:49:11,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764764127] [2021-10-29 05:49:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:49:11,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:49:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:49:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 834 proven. 391 refuted. 0 times theorem prover too weak. 6849 trivial. 0 not checked. [2021-10-29 05:49:11,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:49:11,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764764127] [2021-10-29 05:49:11,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764764127] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:49:11,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977132484] [2021-10-29 05:49:11,570 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:49:11,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:49:11,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:49:11,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:49:11,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-29 05:49:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:49:14,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-29 05:49:14,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:49:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 1023 proven. 507 refuted. 0 times theorem prover too weak. 6544 trivial. 0 not checked. [2021-10-29 05:49:15,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:49:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 1023 proven. 537 refuted. 0 times theorem prover too weak. 6514 trivial. 0 not checked. [2021-10-29 05:49:19,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977132484] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:49:19,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656920292] [2021-10-29 05:49:19,216 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-29 05:49:19,216 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:49:19,217 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:609) 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-29 05:49:19,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:49:19,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2021-10-29 05:49:19,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978904747] [2021-10-29 05:49:19,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 05:49:19,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:49:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 05:49:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-10-29 05:49:19,222 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) [2021-10-29 05:49:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:49:19,611 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2021-10-29 05:49:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 05:49:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) Word has length 527 [2021-10-29 05:49:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:49:19,619 INFO L225 Difference]: With dead ends: 196 [2021-10-29 05:49:19,619 INFO L226 Difference]: Without dead ends: 157 [2021-10-29 05:49:19,621 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2021-10-29 05:49:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-10-29 05:49:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-10-29 05:49:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 106 states have internal predecessors, (122), 28 states have call successors, (28), 24 states have call predecessors, (28), 16 states have return successors, (35), 26 states have call predecessors, (35), 28 states have call successors, (35) [2021-10-29 05:49:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2021-10-29 05:49:19,641 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 527 [2021-10-29 05:49:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:49:19,643 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2021-10-29 05:49:19,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 18 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (30), 13 states have call predecessors, (30), 18 states have call successors, (30) [2021-10-29 05:49:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2021-10-29 05:49:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-10-29 05:49:19,648 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:49:19,648 INFO L513 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-29 05:49:19,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-10-29 05:49:19,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-10-29 05:49:19,864 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:49:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:49:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1780384136, now seen corresponding path program 11 times [2021-10-29 05:49:19,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:49:19,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155482725] [2021-10-29 05:49:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:49:19,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:49:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:49:19,989 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:49:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:49:20,253 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:49:20,254 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:49:20,255 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:49:20,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:49:20,261 INFO L731 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:49:20,268 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:49:20,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:49:20 BoogieIcfgContainer [2021-10-29 05:49:20,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:49:20,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:49:20,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:49:20,493 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:49:20,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:48:08" (3/4) ... [2021-10-29 05:49:20,496 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:49:20,667 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:49:20,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:49:20,673 INFO L168 Benchmark]: Toolchain (without parser) took 73383.09 ms. Allocated memory was 88.1 MB in the beginning and 524.3 MB in the end (delta: 436.2 MB). Free memory was 58.0 MB in the beginning and 150.7 MB in the end (delta: -92.7 MB). Peak memory consumption was 342.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,674 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 88.1 MB. Free memory is still 43.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:49:20,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.63 ms. Allocated memory was 88.1 MB in the beginning and 115.3 MB in the end (delta: 27.3 MB). Free memory was 57.8 MB in the beginning and 92.1 MB in the end (delta: -34.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.51 ms. Allocated memory is still 115.3 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,676 INFO L168 Benchmark]: Boogie Preprocessor took 21.46 ms. Allocated memory is still 115.3 MB. Free memory was 90.8 MB in the beginning and 90.0 MB in the end (delta: 842.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:49:20,676 INFO L168 Benchmark]: RCFGBuilder took 419.82 ms. Allocated memory is still 115.3 MB. Free memory was 90.0 MB in the beginning and 79.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,677 INFO L168 Benchmark]: TraceAbstraction took 72447.83 ms. Allocated memory was 115.3 MB in the beginning and 524.3 MB in the end (delta: 408.9 MB). Free memory was 78.7 MB in the beginning and 170.6 MB in the end (delta: -92.0 MB). Peak memory consumption was 318.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,677 INFO L168 Benchmark]: Witness Printer took 179.67 ms. Allocated memory is still 524.3 MB. Free memory was 170.6 MB in the beginning and 150.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-29 05:49:20,680 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.25 ms. Allocated memory is still 88.1 MB. Free memory is still 43.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 271.63 ms. Allocated memory was 88.1 MB in the beginning and 115.3 MB in the end (delta: 27.3 MB). Free memory was 57.8 MB in the beginning and 92.1 MB in the end (delta: -34.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.51 ms. Allocated memory is still 115.3 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.46 ms. Allocated memory is still 115.3 MB. Free memory was 90.8 MB in the beginning and 90.0 MB in the end (delta: 842.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 419.82 ms. Allocated memory is still 115.3 MB. Free memory was 90.0 MB in the beginning and 79.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 72447.83 ms. Allocated memory was 115.3 MB in the beginning and 524.3 MB in the end (delta: 408.9 MB). Free memory was 78.7 MB in the beginning and 170.6 MB in the end (delta: -92.0 MB). Peak memory consumption was 318.4 MB. Max. memory is 16.1 GB. * Witness Printer took 179.67 ms. Allocated memory is still 524.3 MB. Free memory was 170.6 MB in the beginning and 150.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 72.1s, OverallIterations: 19, TraceHistogramMax: 66, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 517 SDtfs, 1328 SDslu, 3906 SDs, 0 SdLazy, 6210 SolverSat, 1443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9614 GetRequests, 9086 SyntacticMatches, 32 SemanticMatches, 496 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3653 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=17, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 9678 NumberOfCodeBlocks, 8393 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 13769 ConstructedInterpolants, 0 QuantifiedInterpolants, 18181 SizeOfPredicates, 79 NumberOfNonLiveVariables, 7612 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 191041/207171 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]: 549, 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]: 287, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME[ms]: 83, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 60, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME[ms]: 419, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 282, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 40, 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]: 95, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 95, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 13, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 05:49:20,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0206a2-4ebc-4488-a2ea-13a347f74bc3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...