./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan --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 a41367b4fc7aa41b89b9fd5a644044cd6666ca83 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 05:43:23,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:43:23,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:43:23,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:43:23,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:43:23,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:43:23,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:43:23,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:43:23,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:43:23,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:43:23,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:43:23,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:43:23,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:43:23,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:43:23,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:43:23,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:43:23,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:43:23,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:43:23,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:43:23,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:43:23,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:43:23,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:43:23,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:43:23,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:43:23,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:43:23,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:43:23,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:43:23,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:43:23,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:43:23,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:43:23,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:43:23,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:43:23,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:43:23,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:43:23,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:43:23,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:43:23,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:43:23,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:43:23,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:43:23,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:43:23,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:43:23,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:43:23,686 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:43:23,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:43:23,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:43:23,687 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:43:23,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:43:23,688 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:43:23,688 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:43:23,688 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:43:23,688 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:43:23,688 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:43:23,689 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:43:23,689 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:43:23,689 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:43:23,689 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:43:23,689 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:43:23,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:43:23,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:43:23,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:43:23,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:43:23,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:43:23,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:43:23,693 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-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/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-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan 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 -> a41367b4fc7aa41b89b9fd5a644044cd6666ca83 [2020-12-09 05:43:23,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:43:23,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:43:23,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:43:23,885 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:43:23,886 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:43:23,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c [2020-12-09 05:43:23,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/data/70c72123c/881bb499fb054ee6b6972b23e5c10660/FLAGc2107fd09 [2020-12-09 05:43:24,274 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:43:24,274 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c [2020-12-09 05:43:24,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/data/70c72123c/881bb499fb054ee6b6972b23e5c10660/FLAGc2107fd09 [2020-12-09 05:43:24,711 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/data/70c72123c/881bb499fb054ee6b6972b23e5c10660 [2020-12-09 05:43:24,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:43:24,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:43:24,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:43:24,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:43:24,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:43:24,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3413d95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24, skipping insertion in model container [2020-12-09 05:43:24,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:43:24,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:43:24,848 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c[949,962] [2020-12-09 05:43:24,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:43:24,856 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:43:24,867 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/sv-benchmarks/c/recursive-simple/fibo_2calls_10-1.c[949,962] [2020-12-09 05:43:24,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:43:24,877 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:43:24,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24 WrapperNode [2020-12-09 05:43:24,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:43:24,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:43:24,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:43:24,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:43:24,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:43:24,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:43:24,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:43:24,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:43:24,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... [2020-12-09 05:43:24,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:43:24,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:43:24,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:43:24,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:43:24,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:43:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:43:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-12-09 05:43:24,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-12-09 05:43:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:43:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-12-09 05:43:24,981 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-12-09 05:43:24,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:43:24,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:43:25,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:43:25,144 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 05:43:25,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:43:25 BoogieIcfgContainer [2020-12-09 05:43:25,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:43:25,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:43:25,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:43:25,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:43:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:43:24" (1/3) ... [2020-12-09 05:43:25,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b45bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:43:25, skipping insertion in model container [2020-12-09 05:43:25,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:43:24" (2/3) ... [2020-12-09 05:43:25,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b45bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:43:25, skipping insertion in model container [2020-12-09 05:43:25,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:43:25" (3/3) ... [2020-12-09 05:43:25,154 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-1.c [2020-12-09 05:43:25,167 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:43:25,170 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 05:43:25,177 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 05:43:25,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:43:25,194 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:43:25,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:43:25,194 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:43:25,194 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:43:25,194 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:43:25,194 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:43:25,194 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:43:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-12-09 05:43:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:43:25,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:25,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:25,209 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2020-12-09 05:43:25,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:25,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736692204] [2020-12-09 05:43:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:43:25,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736692204] [2020-12-09 05:43:25,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:43:25,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:43:25,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556446005] [2020-12-09 05:43:25,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:43:25,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:43:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:43:25,379 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-12-09 05:43:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:25,448 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-12-09 05:43:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:43:25,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 05:43:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:25,458 INFO L225 Difference]: With dead ends: 34 [2020-12-09 05:43:25,458 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 05:43:25,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:43:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 05:43:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 05:43:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 05:43:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 05:43:25,490 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-12-09 05:43:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:25,490 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 05:43:25,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:43:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 05:43:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 05:43:25,491 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:25,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:25,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:43:25,492 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2020-12-09 05:43:25,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:25,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538577022] [2020-12-09 05:43:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:43:25,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538577022] [2020-12-09 05:43:25,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:43:25,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:43:25,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009038930] [2020-12-09 05:43:25,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:43:25,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:43:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:43:25,537 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-12-09 05:43:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:25,592 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-12-09 05:43:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:43:25,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 05:43:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:25,594 INFO L225 Difference]: With dead ends: 32 [2020-12-09 05:43:25,594 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 05:43:25,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:43:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 05:43:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-09 05:43:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 05:43:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 05:43:25,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-12-09 05:43:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:25,602 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 05:43:25,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:43:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 05:43:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 05:43:25,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:25,604 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:25,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:43:25,604 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2020-12-09 05:43:25,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:25,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792028289] [2020-12-09 05:43:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:25,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792028289] [2020-12-09 05:43:25,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815472394] [2020-12-09 05:43:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:25,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:43:25,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:25,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:25,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [458514116] [2020-12-09 05:43:25,941 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-12-09 05:43:25,942 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:25,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:43:25,951 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:43:25,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:43:26,099 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:26,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:26,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2020-12-09 05:43:26,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585913763] [2020-12-09 05:43:26,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 05:43:26,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 05:43:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:43:26,102 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2020-12-09 05:43:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:26,213 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-12-09 05:43:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 05:43:26,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 05:43:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:26,215 INFO L225 Difference]: With dead ends: 54 [2020-12-09 05:43:26,215 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 05:43:26,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:43:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 05:43:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-12-09 05:43:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 05:43:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-09 05:43:26,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-12-09 05:43:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:26,223 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-09 05:43:26,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 05:43:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-09 05:43:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:43:26,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:26,225 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:26,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 05:43:26,426 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2020-12-09 05:43:26,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:26,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871736358] [2020-12-09 05:43:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:26,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871736358] [2020-12-09 05:43:26,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3522734] [2020-12-09 05:43:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:26,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:43:26,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:26,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:43:26,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1448825970] [2020-12-09 05:43:26,797 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 05:43:26,797 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:26,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:43:26,798 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:43:26,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:43:26,950 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:26,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:26,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2020-12-09 05:43:26,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054076111] [2020-12-09 05:43:26,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:43:26,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:43:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:43:26,951 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-12-09 05:43:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:27,019 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-12-09 05:43:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:43:27,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-09 05:43:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:27,021 INFO L225 Difference]: With dead ends: 39 [2020-12-09 05:43:27,021 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 05:43:27,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:43:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 05:43:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-12-09 05:43:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 05:43:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-12-09 05:43:27,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2020-12-09 05:43:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:27,027 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-12-09 05:43:27,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:43:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-12-09 05:43:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 05:43:27,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:27,028 INFO L422 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] [2020-12-09 05:43:27,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 05:43:27,230 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2020-12-09 05:43:27,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:27,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140943795] [2020-12-09 05:43:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 05:43:27,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140943795] [2020-12-09 05:43:27,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851636729] [2020-12-09 05:43:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:27,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:43:27,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:43:27,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:43:27,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229547325] [2020-12-09 05:43:27,699 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:27,699 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:27,699 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:27,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:27,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2020-12-09 05:43:27,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342921010] [2020-12-09 05:43:27,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 05:43:27,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 05:43:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:43:27,701 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2020-12-09 05:43:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:27,831 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2020-12-09 05:43:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:43:27,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 05:43:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:27,833 INFO L225 Difference]: With dead ends: 66 [2020-12-09 05:43:27,833 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 05:43:27,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-12-09 05:43:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 05:43:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 05:43:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 05:43:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-12-09 05:43:27,839 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2020-12-09 05:43:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:27,839 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-12-09 05:43:27,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 05:43:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-12-09 05:43:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 05:43:27,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:27,840 INFO L422 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] [2020-12-09 05:43:28,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-09 05:43:28,042 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2020-12-09 05:43:28,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:28,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584665195] [2020-12-09 05:43:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 05:43:28,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584665195] [2020-12-09 05:43:28,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177802973] [2020-12-09 05:43:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:28,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:43:28,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 05:43:28,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:43:28,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1288917368] [2020-12-09 05:43:28,406 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:28,407 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:28,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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:28,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:28,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2020-12-09 05:43:28,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209722081] [2020-12-09 05:43:28,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 05:43:28,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 05:43:28,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-09 05:43:28,408 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 18 states. [2020-12-09 05:43:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:28,712 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2020-12-09 05:43:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:43:28,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-12-09 05:43:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:28,714 INFO L225 Difference]: With dead ends: 98 [2020-12-09 05:43:28,714 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 05:43:28,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-12-09 05:43:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 05:43:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2020-12-09 05:43:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 05:43:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2020-12-09 05:43:28,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2020-12-09 05:43:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:28,726 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2020-12-09 05:43:28,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 05:43:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2020-12-09 05:43:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 05:43:28,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:28,728 INFO L422 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] [2020-12-09 05:43:28,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:28,929 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:28,931 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2020-12-09 05:43:28,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:28,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920414337] [2020-12-09 05:43:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 05:43:29,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920414337] [2020-12-09 05:43:29,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747616364] [2020-12-09 05:43:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:29,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:43:29,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 05:43:29,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 05:43:29,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1628652639] [2020-12-09 05:43:29,518 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:29,518 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:29,519 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:29,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:29,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2020-12-09 05:43:29,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187873669] [2020-12-09 05:43:29,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:43:29,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:43:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:43:29,521 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 17 states. [2020-12-09 05:43:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:29,661 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2020-12-09 05:43:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 05:43:29,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-12-09 05:43:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:29,663 INFO L225 Difference]: With dead ends: 102 [2020-12-09 05:43:29,663 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 05:43:29,664 INFO L677 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 [2020-12-09 05:43:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 05:43:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2020-12-09 05:43:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 05:43:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2020-12-09 05:43:29,677 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 50 [2020-12-09 05:43:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:29,678 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2020-12-09 05:43:29,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:43:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2020-12-09 05:43:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-09 05:43:29,681 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:29,682 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:29,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-09 05:43:29,883 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:29,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2020-12-09 05:43:29,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:29,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848570795] [2020-12-09 05:43:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-09 05:43:29,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848570795] [2020-12-09 05:43:29,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921445178] [2020-12-09 05:43:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:30,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 05:43:30,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-12-09 05:43:30,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-12-09 05:43:30,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072868191] [2020-12-09 05:43:30,684 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:30,684 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:30,684 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:30,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:30,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2020-12-09 05:43:30,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308230985] [2020-12-09 05:43:30,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 05:43:30,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 05:43:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2020-12-09 05:43:30,686 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 23 states. [2020-12-09 05:43:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:31,229 INFO L93 Difference]: Finished difference Result 175 states and 367 transitions. [2020-12-09 05:43:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 05:43:31,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2020-12-09 05:43:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:31,231 INFO L225 Difference]: With dead ends: 175 [2020-12-09 05:43:31,231 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 05:43:31,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 05:43:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 05:43:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-09 05:43:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 05:43:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2020-12-09 05:43:31,245 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 106 [2020-12-09 05:43:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:31,246 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2020-12-09 05:43:31,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 05:43:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2020-12-09 05:43:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-09 05:43:31,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:31,248 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:31,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:31,450 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1888157483, now seen corresponding path program 2 times [2020-12-09 05:43:31,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:31,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515639358] [2020-12-09 05:43:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 60 proven. 266 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2020-12-09 05:43:31,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515639358] [2020-12-09 05:43:31,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638172328] [2020-12-09 05:43:31,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:31,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 05:43:31,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:43:31,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:43:31,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 376 proven. 6 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2020-12-09 05:43:31,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 301 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2020-12-09 05:43:32,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91187753] [2020-12-09 05:43:32,449 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:32,449 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:32,449 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:32,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:32,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2020-12-09 05:43:32,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841157960] [2020-12-09 05:43:32,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 05:43:32,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 05:43:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-12-09 05:43:32,452 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand 18 states. [2020-12-09 05:43:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:32,777 INFO L93 Difference]: Finished difference Result 205 states and 314 transitions. [2020-12-09 05:43:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 05:43:32,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 212 [2020-12-09 05:43:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:32,779 INFO L225 Difference]: With dead ends: 205 [2020-12-09 05:43:32,779 INFO L226 Difference]: Without dead ends: 124 [2020-12-09 05:43:32,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2020-12-09 05:43:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-09 05:43:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2020-12-09 05:43:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 05:43:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2020-12-09 05:43:32,789 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 212 [2020-12-09 05:43:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:32,789 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2020-12-09 05:43:32,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 05:43:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2020-12-09 05:43:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-09 05:43:32,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:32,791 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:32,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 05:43:32,993 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 370437973, now seen corresponding path program 1 times [2020-12-09 05:43:32,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:32,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154538501] [2020-12-09 05:43:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 84 proven. 260 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2020-12-09 05:43:33,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154538501] [2020-12-09 05:43:33,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471998183] [2020-12-09 05:43:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:33,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:43:33,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 369 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2020-12-09 05:43:33,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 385 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2020-12-09 05:43:34,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810385783] [2020-12-09 05:43:34,451 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:34,451 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:34,451 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:34,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:34,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2020-12-09 05:43:34,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906015743] [2020-12-09 05:43:34,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 05:43:34,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 05:43:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:43:34,453 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand 25 states. [2020-12-09 05:43:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:35,025 INFO L93 Difference]: Finished difference Result 225 states and 391 transitions. [2020-12-09 05:43:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 05:43:35,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 216 [2020-12-09 05:43:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:35,028 INFO L225 Difference]: With dead ends: 225 [2020-12-09 05:43:35,028 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 05:43:35,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 05:43:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 05:43:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-12-09 05:43:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 05:43:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2020-12-09 05:43:35,038 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 216 [2020-12-09 05:43:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:35,038 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2020-12-09 05:43:35,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 05:43:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2020-12-09 05:43:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-12-09 05:43:35,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:35,045 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 16, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:35,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 05:43:35,246 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash -447130866, now seen corresponding path program 1 times [2020-12-09 05:43:35,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:35,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638732609] [2020-12-09 05:43:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 165 proven. 479 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2020-12-09 05:43:35,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638732609] [2020-12-09 05:43:35,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697346497] [2020-12-09 05:43:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:35,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 05:43:35,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 94 proven. 554 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2020-12-09 05:43:35,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 94 proven. 578 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2020-12-09 05:43:37,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [414182522] [2020-12-09 05:43:37,177 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:37,178 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:37,178 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:37,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:37,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 17] total 29 [2020-12-09 05:43:37,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244395274] [2020-12-09 05:43:37,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 05:43:37,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 05:43:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2020-12-09 05:43:37,180 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand 29 states. [2020-12-09 05:43:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:37,901 INFO L93 Difference]: Finished difference Result 256 states and 467 transitions. [2020-12-09 05:43:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-09 05:43:37,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 281 [2020-12-09 05:43:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:37,903 INFO L225 Difference]: With dead ends: 256 [2020-12-09 05:43:37,903 INFO L226 Difference]: Without dead ends: 155 [2020-12-09 05:43:37,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=2413, Unknown=0, NotChecked=0, Total=2862 [2020-12-09 05:43:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-09 05:43:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2020-12-09 05:43:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-09 05:43:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 215 transitions. [2020-12-09 05:43:37,915 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 215 transitions. Word has length 281 [2020-12-09 05:43:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:37,915 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 215 transitions. [2020-12-09 05:43:37,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 05:43:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 215 transitions. [2020-12-09 05:43:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-12-09 05:43:37,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:37,921 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:38,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 05:43:38,121 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -498618308, now seen corresponding path program 2 times [2020-12-09 05:43:38,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:38,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369602872] [2020-12-09 05:43:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 225 proven. 616 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2020-12-09 05:43:38,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369602872] [2020-12-09 05:43:38,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119841772] [2020-12-09 05:43:38,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:38,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 05:43:38,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:43:38,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:43:38,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2020-12-09 05:43:38,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2020-12-09 05:43:39,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165511448] [2020-12-09 05:43:39,482 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:39,482 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:39,482 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:39,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:39,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2020-12-09 05:43:39,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854133511] [2020-12-09 05:43:39,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 05:43:39,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 05:43:39,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-12-09 05:43:39,485 INFO L87 Difference]: Start difference. First operand 139 states and 215 transitions. Second operand 16 states. [2020-12-09 05:43:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:39,696 INFO L93 Difference]: Finished difference Result 324 states and 577 transitions. [2020-12-09 05:43:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:43:39,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 393 [2020-12-09 05:43:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:39,698 INFO L225 Difference]: With dead ends: 324 [2020-12-09 05:43:39,698 INFO L226 Difference]: Without dead ends: 190 [2020-12-09 05:43:39,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 783 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:43:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-09 05:43:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2020-12-09 05:43:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-09 05:43:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 305 transitions. [2020-12-09 05:43:39,711 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 305 transitions. Word has length 393 [2020-12-09 05:43:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:39,712 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 305 transitions. [2020-12-09 05:43:39,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 05:43:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 305 transitions. [2020-12-09 05:43:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2020-12-09 05:43:39,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:39,715 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 24, 24, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 10, 9, 6, 5, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:39,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 05:43:39,916 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1172898535, now seen corresponding path program 3 times [2020-12-09 05:43:39,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:39,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121656444] [2020-12-09 05:43:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 266 proven. 601 refuted. 0 times theorem prover too weak. 3833 trivial. 0 not checked. [2020-12-09 05:43:40,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121656444] [2020-12-09 05:43:40,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766686799] [2020-12-09 05:43:40,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:40,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:43:40,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:43:40,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 05:43:40,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 2395 proven. 176 refuted. 0 times theorem prover too weak. 2129 trivial. 0 not checked. [2020-12-09 05:43:40,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 296 proven. 1059 refuted. 0 times theorem prover too weak. 3345 trivial. 0 not checked. [2020-12-09 05:43:42,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506525658] [2020-12-09 05:43:42,410 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:42,411 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:42,411 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:42,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:42,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 19] total 27 [2020-12-09 05:43:42,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135547982] [2020-12-09 05:43:42,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 05:43:42,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 05:43:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:43:42,413 INFO L87 Difference]: Start difference. First operand 175 states and 305 transitions. Second operand 27 states. [2020-12-09 05:43:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:43,208 INFO L93 Difference]: Finished difference Result 376 states and 675 transitions. [2020-12-09 05:43:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 05:43:43,208 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 405 [2020-12-09 05:43:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:43,211 INFO L225 Difference]: With dead ends: 376 [2020-12-09 05:43:43,211 INFO L226 Difference]: Without dead ends: 207 [2020-12-09 05:43:43,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 796 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=458, Invalid=2512, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 05:43:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-09 05:43:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2020-12-09 05:43:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:43:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 258 transitions. [2020-12-09 05:43:43,224 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 258 transitions. Word has length 405 [2020-12-09 05:43:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:43,225 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 258 transitions. [2020-12-09 05:43:43,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 05:43:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 258 transitions. [2020-12-09 05:43:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2020-12-09 05:43:43,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:43,228 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 28, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 7, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:43,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2020-12-09 05:43:43,429 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash 724877762, now seen corresponding path program 4 times [2020-12-09 05:43:43,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:43,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729392811] [2020-12-09 05:43:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 667 proven. 961 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2020-12-09 05:43:43,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729392811] [2020-12-09 05:43:43,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481946596] [2020-12-09 05:43:43,774 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:43,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 05:43:43,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 204 proven. 1147 refuted. 0 times theorem prover too weak. 5117 trivial. 0 not checked. [2020-12-09 05:43:44,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 204 proven. 1180 refuted. 0 times theorem prover too weak. 5084 trivial. 0 not checked. [2020-12-09 05:43:46,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556791005] [2020-12-09 05:43:46,462 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:46,462 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:46,462 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:46,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:46,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 35 [2020-12-09 05:43:46,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256084623] [2020-12-09 05:43:46,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 05:43:46,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 05:43:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 05:43:46,465 INFO L87 Difference]: Start difference. First operand 174 states and 258 transitions. Second operand 35 states. [2020-12-09 05:43:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:47,856 INFO L93 Difference]: Finished difference Result 419 states and 771 transitions. [2020-12-09 05:43:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-12-09 05:43:47,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 473 [2020-12-09 05:43:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:47,859 INFO L225 Difference]: With dead ends: 419 [2020-12-09 05:43:47,860 INFO L226 Difference]: Without dead ends: 235 [2020-12-09 05:43:47,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 934 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=790, Invalid=4910, Unknown=0, NotChecked=0, Total=5700 [2020-12-09 05:43:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-09 05:43:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 179. [2020-12-09 05:43:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-09 05:43:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2020-12-09 05:43:47,873 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 473 [2020-12-09 05:43:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:47,873 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2020-12-09 05:43:47,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 05:43:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2020-12-09 05:43:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2020-12-09 05:43:47,879 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:47,879 INFO L422 BasicCegarLoop]: trace histogram [70, 70, 67, 67, 56, 55, 35, 35, 35, 35, 35, 35, 35, 33, 33, 33, 33, 33, 33, 33, 23, 20, 14, 12, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:48,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:48,081 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 753918526, now seen corresponding path program 5 times [2020-12-09 05:43:48,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:48,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451139775] [2020-12-09 05:43:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26021 backedges. 422 proven. 2786 refuted. 0 times theorem prover too weak. 22813 trivial. 0 not checked. [2020-12-09 05:43:48,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451139775] [2020-12-09 05:43:48,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103641728] [2020-12-09 05:43:48,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:49,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2020-12-09 05:43:49,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:43:49,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 05:43:49,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26021 backedges. 1530 proven. 240 refuted. 0 times theorem prover too weak. 24251 trivial. 0 not checked. [2020-12-09 05:43:49,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:43:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26021 backedges. 1530 proven. 254 refuted. 0 times theorem prover too weak. 24237 trivial. 0 not checked. [2020-12-09 05:43:52,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [932759751] [2020-12-09 05:43:52,297 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:43:52,297 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:43:52,297 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:43:52,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:43:52,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 13] total 21 [2020-12-09 05:43:52,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14805012] [2020-12-09 05:43:52,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 05:43:52,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:43:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 05:43:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-12-09 05:43:52,300 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand 21 states. [2020-12-09 05:43:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:43:52,545 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2020-12-09 05:43:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:43:52,545 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 936 [2020-12-09 05:43:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:43:52,550 INFO L225 Difference]: With dead ends: 199 [2020-12-09 05:43:52,550 INFO L226 Difference]: Without dead ends: 195 [2020-12-09 05:43:52,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1902 GetRequests, 1870 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2020-12-09 05:43:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-12-09 05:43:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2020-12-09 05:43:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-09 05:43:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2020-12-09 05:43:52,562 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 936 [2020-12-09 05:43:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:43:52,563 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2020-12-09 05:43:52,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 05:43:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2020-12-09 05:43:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2020-12-09 05:43:52,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:43:52,573 INFO L422 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 76, 75, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 46, 30, 28, 18, 18, 1, 1, 1, 1, 1, 1] [2020-12-09 05:43:52,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2020-12-09 05:43:52,774 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:43:52,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:43:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash 323038645, now seen corresponding path program 6 times [2020-12-09 05:43:52,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:43:52,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271841996] [2020-12-09 05:43:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:43:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:43:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 1363 proven. 2105 refuted. 0 times theorem prover too weak. 45217 trivial. 0 not checked. [2020-12-09 05:43:53,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271841996] [2020-12-09 05:43:53,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101574192] [2020-12-09 05:43:53,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:43:54,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:43:54,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:43:54,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 2270 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 05:43:54,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:43:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 25925 proven. 1906 refuted. 0 times theorem prover too weak. 20854 trivial. 0 not checked. [2020-12-09 05:43:55,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:44:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 1660 proven. 5743 refuted. 0 times theorem prover too weak. 41282 trivial. 0 not checked. [2020-12-09 05:44:02,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1118358268] [2020-12-09 05:44:02,185 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:44:02,185 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:44:02,186 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:44:02,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:44:02,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 31] total 39 [2020-12-09 05:44:02,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560838163] [2020-12-09 05:44:02,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 05:44:02,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:44:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 05:44:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 05:44:02,190 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 39 states. [2020-12-09 05:44:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:44:04,276 INFO L93 Difference]: Finished difference Result 539 states and 998 transitions. [2020-12-09 05:44:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-12-09 05:44:04,277 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1276 [2020-12-09 05:44:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:44:04,282 INFO L225 Difference]: With dead ends: 539 [2020-12-09 05:44:04,282 INFO L226 Difference]: Without dead ends: 353 [2020-12-09 05:44:04,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2616 GetRequests, 2528 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1036, Invalid=6620, Unknown=0, NotChecked=0, Total=7656 [2020-12-09 05:44:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-12-09 05:44:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 260. [2020-12-09 05:44:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-09 05:44:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 419 transitions. [2020-12-09 05:44:04,301 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 419 transitions. Word has length 1276 [2020-12-09 05:44:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:44:04,302 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 419 transitions. [2020-12-09 05:44:04,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 05:44:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 419 transitions. [2020-12-09 05:44:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1631 [2020-12-09 05:44:04,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:44:04,317 INFO L422 BasicCegarLoop]: trace histogram [122, 122, 117, 117, 97, 96, 61, 61, 61, 61, 61, 61, 61, 58, 58, 58, 58, 58, 58, 58, 39, 35, 25, 21, 1, 1, 1, 1, 1, 1] [2020-12-09 05:44:04,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:04,518 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:44:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:44:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1403033995, now seen corresponding path program 7 times [2020-12-09 05:44:04,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:44:04,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276719842] [2020-12-09 05:44:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:44:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 79816 backedges. 2575 proven. 1245 refuted. 0 times theorem prover too weak. 75996 trivial. 0 not checked. [2020-12-09 05:44:06,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276719842] [2020-12-09 05:44:06,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509707644] [2020-12-09 05:44:06,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:06,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 3650 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 05:44:06,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:44:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 79816 backedges. 2274 proven. 4152 refuted. 0 times theorem prover too weak. 73390 trivial. 0 not checked. [2020-12-09 05:44:08,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:44:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 79816 backedges. 2274 proven. 4204 refuted. 0 times theorem prover too weak. 73338 trivial. 0 not checked. [2020-12-09 05:44:15,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [184871855] [2020-12-09 05:44:15,874 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:44:15,874 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:44:15,874 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:44:15,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:44:15,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 23] total 34 [2020-12-09 05:44:15,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248699446] [2020-12-09 05:44:15,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 05:44:15,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:44:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 05:44:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 05:44:15,878 INFO L87 Difference]: Start difference. First operand 260 states and 419 transitions. Second operand 34 states. [2020-12-09 05:44:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:44:17,373 INFO L93 Difference]: Finished difference Result 717 states and 1457 transitions. [2020-12-09 05:44:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-12-09 05:44:17,374 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1630 [2020-12-09 05:44:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:44:17,380 INFO L225 Difference]: With dead ends: 717 [2020-12-09 05:44:17,380 INFO L226 Difference]: Without dead ends: 409 [2020-12-09 05:44:17,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3312 GetRequests, 3239 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=699, Invalid=4557, Unknown=0, NotChecked=0, Total=5256 [2020-12-09 05:44:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2020-12-09 05:44:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 300. [2020-12-09 05:44:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-09 05:44:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 483 transitions. [2020-12-09 05:44:17,404 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 483 transitions. Word has length 1630 [2020-12-09 05:44:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:44:17,405 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 483 transitions. [2020-12-09 05:44:17,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 05:44:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 483 transitions. [2020-12-09 05:44:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2020-12-09 05:44:17,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:44:17,415 INFO L422 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 74, 74, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 29, 28, 18, 17, 1, 1, 1, 1, 1, 1] [2020-12-09 05:44:17,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-12-09 05:44:17,616 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:44:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:44:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1382221845, now seen corresponding path program 8 times [2020-12-09 05:44:17,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:44:17,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854126869] [2020-12-09 05:44:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:44:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 46626 backedges. 1274 proven. 1627 refuted. 0 times theorem prover too weak. 43725 trivial. 0 not checked. [2020-12-09 05:44:18,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854126869] [2020-12-09 05:44:18,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795827952] [2020-12-09 05:44:18,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:19,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2020-12-09 05:44:19,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:44:19,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 05:44:19,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:44:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 46626 backedges. 4449 proven. 702 refuted. 0 times theorem prover too weak. 41475 trivial. 0 not checked. [2020-12-09 05:44:20,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:44:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 46626 backedges. 4451 proven. 718 refuted. 0 times theorem prover too weak. 41457 trivial. 0 not checked. [2020-12-09 05:44:25,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913454062] [2020-12-09 05:44:25,508 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:44:25,509 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:44:25,509 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:44:25,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:44:25,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 23] total 32 [2020-12-09 05:44:25,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115159755] [2020-12-09 05:44:25,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 05:44:25,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:44:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 05:44:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2020-12-09 05:44:25,512 INFO L87 Difference]: Start difference. First operand 300 states and 483 transitions. Second operand 32 states. [2020-12-09 05:44:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:44:26,660 INFO L93 Difference]: Finished difference Result 873 states and 1681 transitions. [2020-12-09 05:44:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-12-09 05:44:26,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1249 [2020-12-09 05:44:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:44:26,667 INFO L225 Difference]: With dead ends: 873 [2020-12-09 05:44:26,667 INFO L226 Difference]: Without dead ends: 470 [2020-12-09 05:44:26,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2547 GetRequests, 2473 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=678, Invalid=3878, Unknown=0, NotChecked=0, Total=4556 [2020-12-09 05:44:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-12-09 05:44:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 357. [2020-12-09 05:44:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-12-09 05:44:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 602 transitions. [2020-12-09 05:44:26,695 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 602 transitions. Word has length 1249 [2020-12-09 05:44:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:44:26,695 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 602 transitions. [2020-12-09 05:44:26,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 05:44:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 602 transitions. [2020-12-09 05:44:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2162 [2020-12-09 05:44:26,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:44:26,721 INFO L422 BasicCegarLoop]: trace histogram [162, 162, 155, 155, 129, 127, 81, 81, 81, 81, 81, 81, 81, 77, 77, 77, 77, 77, 77, 77, 50, 48, 35, 26, 1, 1, 1, 1, 1, 1] [2020-12-09 05:44:26,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:26,923 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:44:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:44:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 989104214, now seen corresponding path program 9 times [2020-12-09 05:44:26,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:44:26,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114519346] [2020-12-09 05:44:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:44:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 140825 backedges. 2031 proven. 4256 refuted. 0 times theorem prover too weak. 134538 trivial. 0 not checked. [2020-12-09 05:44:29,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114519346] [2020-12-09 05:44:29,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530209353] [2020-12-09 05:44:29,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:30,242 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:44:30,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:44:30,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 3845 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 05:44:30,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:44:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 140825 backedges. 68427 proven. 2585 refuted. 0 times theorem prover too weak. 69813 trivial. 0 not checked. [2020-12-09 05:44:33,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:44:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 140825 backedges. 2481 proven. 11255 refuted. 0 times theorem prover too weak. 127089 trivial. 0 not checked. [2020-12-09 05:44:44,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [754293667] [2020-12-09 05:44:44,495 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:44:44,495 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:44:44,496 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:44:44,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:44:44,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 33] total 44 [2020-12-09 05:44:44,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554148633] [2020-12-09 05:44:44,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-09 05:44:44,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:44:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-09 05:44:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 05:44:44,501 INFO L87 Difference]: Start difference. First operand 357 states and 602 transitions. Second operand 44 states. [2020-12-09 05:44:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:44:46,453 INFO L93 Difference]: Finished difference Result 969 states and 1865 transitions. [2020-12-09 05:44:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-12-09 05:44:46,454 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2161 [2020-12-09 05:44:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:44:46,460 INFO L225 Difference]: With dead ends: 969 [2020-12-09 05:44:46,460 INFO L226 Difference]: Without dead ends: 518 [2020-12-09 05:44:46,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4387 GetRequests, 4295 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=7244, Unknown=0, NotChecked=0, Total=8372 [2020-12-09 05:44:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-12-09 05:44:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 391. [2020-12-09 05:44:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-12-09 05:44:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 661 transitions. [2020-12-09 05:44:46,490 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 661 transitions. Word has length 2161 [2020-12-09 05:44:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:44:46,491 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 661 transitions. [2020-12-09 05:44:46,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-09 05:44:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 661 transitions. [2020-12-09 05:44:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2020-12-09 05:44:46,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:44:46,503 INFO L422 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 83, 81, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 21, 18, 1, 1, 1, 1, 1, 1] [2020-12-09 05:44:46,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-12-09 05:44:46,705 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:44:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:44:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1993670385, now seen corresponding path program 10 times [2020-12-09 05:44:46,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:44:46,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819863073] [2020-12-09 05:44:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:44:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 57447 backedges. 2774 proven. 1199 refuted. 0 times theorem prover too weak. 53474 trivial. 0 not checked. [2020-12-09 05:44:48,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819863073] [2020-12-09 05:44:48,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839104845] [2020-12-09 05:44:48,382 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:48,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 05:44:48,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:44:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 57447 backedges. 3404 proven. 1468 refuted. 0 times theorem prover too weak. 52575 trivial. 0 not checked. [2020-12-09 05:44:50,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:44:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 57447 backedges. 3404 proven. 1510 refuted. 0 times theorem prover too weak. 52533 trivial. 0 not checked. [2020-12-09 05:44:56,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366348503] [2020-12-09 05:44:56,606 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:44:56,606 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:44:56,606 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:44:56,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:44:56,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 27 [2020-12-09 05:44:56,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064035430] [2020-12-09 05:44:56,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 05:44:56,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:44:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 05:44:56,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:44:56,610 INFO L87 Difference]: Start difference. First operand 391 states and 661 transitions. Second operand 27 states. [2020-12-09 05:44:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:44:56,910 INFO L93 Difference]: Finished difference Result 418 states and 743 transitions. [2020-12-09 05:44:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 05:44:56,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1385 [2020-12-09 05:44:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:44:56,916 INFO L225 Difference]: With dead ends: 418 [2020-12-09 05:44:56,916 INFO L226 Difference]: Without dead ends: 414 [2020-12-09 05:44:56,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2796 GetRequests, 2760 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 05:44:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-12-09 05:44:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2020-12-09 05:44:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-12-09 05:44:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 671 transitions. [2020-12-09 05:44:56,941 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 671 transitions. Word has length 1385 [2020-12-09 05:44:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:44:56,942 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 671 transitions. [2020-12-09 05:44:56,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 05:44:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 671 transitions. [2020-12-09 05:44:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-12-09 05:44:56,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:44:56,953 INFO L422 BasicCegarLoop]: trace histogram [90, 90, 87, 87, 72, 71, 45, 45, 45, 45, 45, 45, 45, 43, 43, 43, 43, 43, 43, 43, 29, 26, 18, 16, 1, 1, 1, 1, 1, 1] [2020-12-09 05:44:57,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-12-09 05:44:57,153 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:44:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:44:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash -700720480, now seen corresponding path program 11 times [2020-12-09 05:44:57,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:44:57,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940865322] [2020-12-09 05:44:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:44:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:44:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 1381 proven. 1423 refuted. 0 times theorem prover too weak. 40793 trivial. 0 not checked. [2020-12-09 05:44:58,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940865322] [2020-12-09 05:44:58,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699975304] [2020-12-09 05:44:58,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:44:58,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-12-09 05:44:58,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:44:58,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 05:44:58,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:44:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 7065 proven. 63 refuted. 0 times theorem prover too weak. 36469 trivial. 0 not checked. [2020-12-09 05:44:59,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:45:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 2969 proven. 191 refuted. 0 times theorem prover too weak. 40437 trivial. 0 not checked. [2020-12-09 05:45:03,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [602434095] [2020-12-09 05:45:03,848 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:45:03,848 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:45:03,849 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:45:03,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:45:03,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 22 [2020-12-09 05:45:03,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030222124] [2020-12-09 05:45:03,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 05:45:03,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:45:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 05:45:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-12-09 05:45:03,852 INFO L87 Difference]: Start difference. First operand 398 states and 671 transitions. Second operand 22 states. [2020-12-09 05:45:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:45:04,660 INFO L93 Difference]: Finished difference Result 945 states and 1695 transitions. [2020-12-09 05:45:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-09 05:45:04,661 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1208 [2020-12-09 05:45:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:45:04,667 INFO L225 Difference]: With dead ends: 945 [2020-12-09 05:45:04,667 INFO L226 Difference]: Without dead ends: 513 [2020-12-09 05:45:04,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2453 GetRequests, 2407 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 05:45:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-12-09 05:45:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 372. [2020-12-09 05:45:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-12-09 05:45:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 594 transitions. [2020-12-09 05:45:04,694 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 594 transitions. Word has length 1208 [2020-12-09 05:45:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:45:04,694 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 594 transitions. [2020-12-09 05:45:04,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 05:45:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 594 transitions. [2020-12-09 05:45:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-12-09 05:45:04,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:45:04,704 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2020-12-09 05:45:04,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-09 05:45:04,905 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:45:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:45:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411898, now seen corresponding path program 12 times [2020-12-09 05:45:04,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:45:04,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291539034] [2020-12-09 05:45:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:45:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:45:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 0 proven. 14453 refuted. 0 times theorem prover too weak. 29132 trivial. 0 not checked. [2020-12-09 05:45:08,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291539034] [2020-12-09 05:45:08,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345092692] [2020-12-09 05:45:08,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:45:08,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:45:08,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:45:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 711 conjunts are in the unsatisfiable core [2020-12-09 05:45:08,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:45:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 0 proven. 14453 refuted. 0 times theorem prover too weak. 29132 trivial. 0 not checked. [2020-12-09 05:45:12,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:45:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 0 proven. 14453 refuted. 0 times theorem prover too weak. 29132 trivial. 0 not checked. [2020-12-09 05:45:25,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [779219901] [2020-12-09 05:45:25,842 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:45:25,842 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:45:25,842 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:45:25,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:45:25,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 68 [2020-12-09 05:45:25,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946262070] [2020-12-09 05:45:25,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 68 states [2020-12-09 05:45:25,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:45:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2020-12-09 05:45:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2020-12-09 05:45:25,846 INFO L87 Difference]: Start difference. First operand 372 states and 594 transitions. Second operand 68 states. [2020-12-09 05:45:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:45:27,029 INFO L93 Difference]: Finished difference Result 389 states and 631 transitions. [2020-12-09 05:45:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-12-09 05:45:27,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1208 [2020-12-09 05:45:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:45:27,034 INFO L225 Difference]: With dead ends: 389 [2020-12-09 05:45:27,034 INFO L226 Difference]: Without dead ends: 383 [2020-12-09 05:45:27,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2771 GetRequests, 2452 SyntacticMatches, 253 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2020-12-09 05:45:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2020-12-09 05:45:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 372. [2020-12-09 05:45:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-12-09 05:45:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 591 transitions. [2020-12-09 05:45:27,054 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 591 transitions. Word has length 1208 [2020-12-09 05:45:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:45:27,054 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 591 transitions. [2020-12-09 05:45:27,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2020-12-09 05:45:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 591 transitions. [2020-12-09 05:45:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1781 [2020-12-09 05:45:27,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:45:27,073 INFO L422 BasicCegarLoop]: trace histogram [131, 131, 130, 130, 106, 105, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 41, 40, 25, 25, 1, 1, 1, 1, 1, 1] [2020-12-09 05:45:27,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-12-09 05:45:27,274 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:45:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:45:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash -928733104, now seen corresponding path program 13 times [2020-12-09 05:45:27,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:45:27,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741538334] [2020-12-09 05:45:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:45:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:45:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 95265 backedges. 1368 proven. 6608 refuted. 0 times theorem prover too weak. 87289 trivial. 0 not checked. [2020-12-09 05:45:29,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741538334] [2020-12-09 05:45:29,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068516294] [2020-12-09 05:45:29,213 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:45:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:45:29,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 3983 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 05:45:29,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:45:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 95265 backedges. 1368 proven. 6608 refuted. 0 times theorem prover too weak. 87289 trivial. 0 not checked. [2020-12-09 05:45:32,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:45:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 95265 backedges. 1368 proven. 6673 refuted. 0 times theorem prover too weak. 87224 trivial. 0 not checked. [2020-12-09 05:45:42,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790001118] [2020-12-09 05:45:42,354 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 05:45:42,354 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:45:42,355 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:45:42,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:45:42,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 25] total 27 [2020-12-09 05:45:42,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522525262] [2020-12-09 05:45:42,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 05:45:42,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:45:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 05:45:42,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:45:42,359 INFO L87 Difference]: Start difference. First operand 372 states and 591 transitions. Second operand 27 states. [2020-12-09 05:45:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:45:42,709 INFO L93 Difference]: Finished difference Result 380 states and 613 transitions. [2020-12-09 05:45:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:45:42,710 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1780 [2020-12-09 05:45:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:45:42,712 INFO L225 Difference]: With dead ends: 380 [2020-12-09 05:45:42,712 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:45:42,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3594 GetRequests, 3556 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 05:45:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:45:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:45:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:45:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:45:42,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1780 [2020-12-09 05:45:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:45:42,715 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:45:42,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 05:45:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:45:42,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:45:42,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:45:42,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 05:45:48,597 WARN L197 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 377 DAG size of output: 26 [2020-12-09 05:45:49,140 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 1 [2020-12-09 05:45:50,434 WARN L197 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 387 DAG size of output: 9 [2020-12-09 05:45:51,276 WARN L197 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 368 DAG size of output: 1 [2020-12-09 05:45:53,638 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 419 DAG size of output: 37 [2020-12-09 05:45:55,196 WARN L197 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 402 DAG size of output: 7 [2020-12-09 05:45:55,198 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 05:45:55,198 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 05:45:55,198 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2020-12-09 05:45:55,198 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 05:45:55,198 INFO L262 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L258 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 10) (<= 10 ULTIMATE.start_main_~x~0)) [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L258 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~x~0) [2020-12-09 05:45:55,199 INFO L265 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-12-09 05:45:55,199 INFO L258 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 3 |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n) (<= fibo2_~n |fibo2_#in~n|)) [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L258 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (or (and (<= 21 |fibo2_#t~ret9|) (<= |fibo2_#t~ret9| 21)) (<= |fibo2_#in~n| 8) (<= 10 |fibo2_#in~n|)) (or (and (<= |fibo2_#t~ret9| 13) (<= 13 |fibo2_#t~ret9|)) (<= 9 fibo2_~n)) (<= |fibo2_#in~n| fibo2_~n) (not (<= |fibo2_#in~n| 7)) (<= fibo2_~n |fibo2_#in~n|)) [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point L22(lines 22 26) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point L25-3(line 25) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point L20(lines 20 26) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L262 CegarLoopResult]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2020-12-09 05:45:55,199 INFO L265 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-12-09 05:45:55,200 INFO L258 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 6)) (<= |fibo1_#in~n| fibo1_~n) (<= fibo1_~n |fibo1_#in~n|)) [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-12-09 05:45:55,200 INFO L258 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (let ((.cse1 (<= |fibo1_#in~n| fibo1_~n)) (.cse0 (<= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 9 |fibo1_#in~n|) (or (and (<= 34 |fibo1_#t~ret7|) .cse1 (<= |fibo1_#t~ret7| 34)) (and .cse1 (<= |fibo1_#in~n| 9)))) (and (<= 11 |fibo1_#in~n|) .cse1 .cse0) (and .cse1 (<= |fibo1_#in~n| 7) .cse0) (and (<= |fibo1_#in~n| 8) (<= 13 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 13)))) (not (<= |fibo1_#in~n| 6)) (or (<= 8 fibo1_~n) (and (<= |fibo1_#t~ret7| 8) (<= 8 |fibo1_#t~ret7|)))) [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point L12(lines 12 16) no Hoare annotation was computed. [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point L10(lines 10 16) no Hoare annotation was computed. [2020-12-09 05:45:55,200 INFO L262 CegarLoopResult]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2020-12-09 05:45:55,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:45:55 BoogieIcfgContainer [2020-12-09 05:45:55,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:45:55,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:45:55,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:45:55,210 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:45:55,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:43:25" (3/4) ... [2020-12-09 05:45:55,213 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:45:55,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2020-12-09 05:45:55,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2020-12-09 05:45:55,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-12-09 05:45:55,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 05:45:55,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 05:45:55,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:45:55,248 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_56fedb17-ac4b-478a-b5ec-4c7d1c250de7/bin/utaipan/witness.graphml [2020-12-09 05:45:55,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:45:55,249 INFO L168 Benchmark]: Toolchain (without parser) took 150532.75 ms. Allocated memory was 125.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 90.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 140.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,249 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 125.8 MB. Free memory was 97.2 MB in the beginning and 97.2 MB in the end (delta: 24.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:45:55,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.51 ms. Allocated memory is still 125.8 MB. Free memory was 89.7 MB in the beginning and 100.8 MB in the end (delta: -11.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.52 ms. Allocated memory is still 125.8 MB. Free memory was 100.8 MB in the beginning and 99.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,250 INFO L168 Benchmark]: Boogie Preprocessor took 12.75 ms. Allocated memory is still 125.8 MB. Free memory was 99.6 MB in the beginning and 98.6 MB in the end (delta: 950.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:45:55,250 INFO L168 Benchmark]: RCFGBuilder took 233.95 ms. Allocated memory is still 125.8 MB. Free memory was 98.6 MB in the beginning and 83.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,251 INFO L168 Benchmark]: TraceAbstraction took 150061.38 ms. Allocated memory was 125.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 83.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,251 INFO L168 Benchmark]: Witness Printer took 38.50 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:45:55,253 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.16 ms. Allocated memory is still 125.8 MB. Free memory was 97.2 MB in the beginning and 97.2 MB in the end (delta: 24.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 159.51 ms. Allocated memory is still 125.8 MB. Free memory was 89.7 MB in the beginning and 100.8 MB in the end (delta: -11.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 20.52 ms. Allocated memory is still 125.8 MB. Free memory was 100.8 MB in the beginning and 99.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.75 ms. Allocated memory is still 125.8 MB. Free memory was 99.6 MB in the beginning and 98.6 MB in the end (delta: 950.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 233.95 ms. Allocated memory is still 125.8 MB. Free memory was 98.6 MB in the beginning and 83.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 150061.38 ms. Allocated memory was 125.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 83.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 38.50 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 10 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 137.7s, OverallIterations: 23, TraceHistogramMax: 162, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 827 SDtfs, 2528 SDslu, 11978 SDs, 0 SdLazy, 19876 SolverSat, 3908 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31214 GetRequests, 29985 SyntacticMatches, 294 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11477 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 850 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 1964 PreInvPairs, 4703 NumberOfFragments, 144 HoareAnnotationTreeSize, 1964 FomulaSimplifications, 911687 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1560667 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 100.7s InterpolantComputationTime, 30189 NumberOfCodeBlocks, 26853 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 45209 ConstructedInterpolants, 0 QuantifiedInterpolants, 78914608 SizeOfPredicates, 160 NumberOfNonLiveVariables, 26201 ConjunctsInSsa, 1015 ConjunctsInUnsatCore, 65 InterpolantComputations, 2 PerfectInterpolantSequences, 1685737/1807731 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...