./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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 675300a4b632e073b31d1e86ab5660e0c5ab887b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:04:10,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:04:10,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:04:10,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:04:10,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:04:10,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:04:10,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:04:10,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:04:10,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:04:10,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:04:10,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:04:10,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:04:10,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:04:10,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:04:10,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:04:10,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:04:10,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:04:10,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:04:10,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:04:10,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:04:10,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:04:10,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:04:10,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:04:10,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:04:10,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:04:10,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:04:10,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:04:10,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:04:10,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:04:10,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:04:10,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:04:10,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:04:10,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:04:10,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:04:10,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:04:10,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:04:10,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:04:10,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:04:10,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:04:10,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:04:10,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:04:10,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:04:10,656 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:04:10,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:04:10,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:04:10,659 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:04:10,660 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:04:10,660 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:04:10,660 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:04:10,660 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:04:10,661 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:04:10,661 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:04:10,662 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:04:10,662 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:04:10,663 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:04:10,663 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:04:10,663 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:04:10,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:04:10,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:04:10,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:04:10,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:04:10,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:04:10,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:04:10,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:04:10,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:04:10,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:04:10,667 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:04:10,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:04:10,667 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:04:10,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:04:10,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:04:10,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:04:10,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:04:10,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:04:10,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:04:10,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:04:10,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:04:10,670 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:04:10,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:04:10,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:04:10,670 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:04:10,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:04:10,671 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_81b58d19-93e7-4e9a-8722-a5e421047f10/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_81b58d19-93e7-4e9a-8722-a5e421047f10/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 -> 675300a4b632e073b31d1e86ab5660e0c5ab887b [2020-11-30 02:04:11,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:04:11,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:04:11,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:04:11,102 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:04:11,103 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:04:11,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02.c [2020-11-30 02:04:11,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/data/2c5d00745/a086bd3e174742b1aad47f6d0e03932d/FLAG9d65deb0a [2020-11-30 02:04:11,893 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:04:11,894 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/sv-benchmarks/c/recursive/Fibonacci02.c [2020-11-30 02:04:11,907 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/data/2c5d00745/a086bd3e174742b1aad47f6d0e03932d/FLAG9d65deb0a [2020-11-30 02:04:12,238 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/data/2c5d00745/a086bd3e174742b1aad47f6d0e03932d [2020-11-30 02:04:12,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:04:12,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:04:12,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:04:12,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:04:12,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:04:12,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25432e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12, skipping insertion in model container [2020-11-30 02:04:12,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:04:12,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:04:12,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:04:12,570 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:04:12,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:04:12,604 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:04:12,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12 WrapperNode [2020-11-30 02:04:12,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:04:12,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:04:12,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:04:12,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:04:12,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:04:12,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:04:12,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:04:12,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:04:12,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... [2020-11-30 02:04:12,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:04:12,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:04:12,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:04:12,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:04:12,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-30 02:04:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-30 02:04:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:04:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:04:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:04:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:04:13,256 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:04:13,257 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 02:04:13,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:04:13 BoogieIcfgContainer [2020-11-30 02:04:13,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:04:13,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:04:13,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:04:13,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:04:13,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:04:12" (1/3) ... [2020-11-30 02:04:13,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503f6023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:04:13, skipping insertion in model container [2020-11-30 02:04:13,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:04:12" (2/3) ... [2020-11-30 02:04:13,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503f6023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:04:13, skipping insertion in model container [2020-11-30 02:04:13,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:04:13" (3/3) ... [2020-11-30 02:04:13,274 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-11-30 02:04:13,288 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:04:13,293 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:04:13,309 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 02:04:13,353 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:04:13,353 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:04:13,354 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:04:13,354 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:04:13,354 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:04:13,354 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:04:13,355 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:04:13,355 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:04:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-30 02:04:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:04:13,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:13,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:13,387 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1744630214, now seen corresponding path program 1 times [2020-11-30 02:04:13,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:13,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694651195] [2020-11-30 02:04:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:04:13,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694651195] [2020-11-30 02:04:13,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:04:13,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:04:13,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100493477] [2020-11-30 02:04:13,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:04:13,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:04:13,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:04:13,714 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-11-30 02:04:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:13,857 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-11-30 02:04:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:04:13,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 02:04:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:13,876 INFO L225 Difference]: With dead ends: 25 [2020-11-30 02:04:13,876 INFO L226 Difference]: Without dead ends: 17 [2020-11-30 02:04:13,881 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-11-30 02:04:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-30 02:04:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-30 02:04:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 02:04:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-11-30 02:04:13,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2020-11-30 02:04:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:13,937 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-30 02:04:13,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:04:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-11-30 02:04:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:04:13,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:13,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:13,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:04:13,943 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1849803624, now seen corresponding path program 1 times [2020-11-30 02:04:13,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:13,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664504949] [2020-11-30 02:04:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:04:14,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664504949] [2020-11-30 02:04:14,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:04:14,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:04:14,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366262151] [2020-11-30 02:04:14,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:04:14,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:04:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:04:14,072 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-11-30 02:04:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:14,171 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-11-30 02:04:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:04:14,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-30 02:04:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:14,174 INFO L225 Difference]: With dead ends: 23 [2020-11-30 02:04:14,175 INFO L226 Difference]: Without dead ends: 19 [2020-11-30 02:04:14,176 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-11-30 02:04:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-11-30 02:04:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-11-30 02:04:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 02:04:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-11-30 02:04:14,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2020-11-30 02:04:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:14,189 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-30 02:04:14,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:04:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-11-30 02:04:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:04:14,193 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:14,193 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:14,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:04:14,194 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 604295251, now seen corresponding path program 1 times [2020-11-30 02:04:14,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:14,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255317835] [2020-11-30 02:04:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:04:14,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255317835] [2020-11-30 02:04:14,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911911641] [2020-11-30 02:04:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:14,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:04:14,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:04:14,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:14,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:04:14,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:04:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 02:04:14,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1813955037] [2020-11-30 02:04:15,013 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:15,014 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:15,021 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:15,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:15,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2020-11-30 02:04:15,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418365732] [2020-11-30 02:04:15,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 02:04:15,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 02:04:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:04:15,025 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2020-11-30 02:04:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:15,223 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2020-11-30 02:04:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:04:15,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-30 02:04:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:15,226 INFO L225 Difference]: With dead ends: 34 [2020-11-30 02:04:15,226 INFO L226 Difference]: Without dead ends: 19 [2020-11-30 02:04:15,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-30 02:04:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-11-30 02:04:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-11-30 02:04:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-30 02:04:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-11-30 02:04:15,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2020-11-30 02:04:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:15,241 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-30 02:04:15,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 02:04:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-11-30 02:04:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 02:04:15,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:15,246 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:15,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 02:04:15,447 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash 570097149, now seen corresponding path program 1 times [2020-11-30 02:04:15,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:15,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027070642] [2020-11-30 02:04:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 02:04:15,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027070642] [2020-11-30 02:04:15,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308583107] [2020-11-30 02:04:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:15,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:04:15,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 02:04:15,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 02:04:15,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [178306123] [2020-11-30 02:04:15,868 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:15,868 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:15,869 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:15,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:15,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2020-11-30 02:04:15,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205646997] [2020-11-30 02:04:15,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 02:04:15,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:15,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 02:04:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:04:15,872 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2020-11-30 02:04:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:16,012 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-11-30 02:04:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:04:16,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-30 02:04:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:16,015 INFO L225 Difference]: With dead ends: 28 [2020-11-30 02:04:16,016 INFO L226 Difference]: Without dead ends: 24 [2020-11-30 02:04:16,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:04:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-30 02:04:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-30 02:04:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 02:04:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-11-30 02:04:16,035 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2020-11-30 02:04:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:16,036 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-11-30 02:04:16,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 02:04:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-11-30 02:04:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 02:04:16,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:16,043 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:16,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:16,258 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1534044912, now seen corresponding path program 2 times [2020-11-30 02:04:16,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:16,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453083081] [2020-11-30 02:04:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 02:04:16,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453083081] [2020-11-30 02:04:16,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326422690] [2020-11-30 02:04:16,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:16,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 02:04:16,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:16,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:04:16,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-30 02:04:16,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 02:04:16,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [763897556] [2020-11-30 02:04:16,947 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:16,947 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:16,948 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:16,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:16,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2020-11-30 02:04:16,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359592294] [2020-11-30 02:04:16,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 02:04:16,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 02:04:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:04:16,951 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 13 states. [2020-11-30 02:04:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:17,417 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-11-30 02:04:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:04:17,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-11-30 02:04:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:17,420 INFO L225 Difference]: With dead ends: 55 [2020-11-30 02:04:17,420 INFO L226 Difference]: Without dead ends: 33 [2020-11-30 02:04:17,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2020-11-30 02:04:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-30 02:04:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-11-30 02:04:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-30 02:04:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-11-30 02:04:17,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2020-11-30 02:04:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:17,432 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-11-30 02:04:17,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 02:04:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-11-30 02:04:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:04:17,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:17,434 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:17,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:17,659 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1569424706, now seen corresponding path program 3 times [2020-11-30 02:04:17,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:17,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633580051] [2020-11-30 02:04:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 02:04:17,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633580051] [2020-11-30 02:04:17,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191528696] [2020-11-30 02:04:17,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:17,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:04:17,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:17,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:04:17,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 02:04:17,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-30 02:04:18,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335539788] [2020-11-30 02:04:18,305 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:18,306 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:18,306 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:18,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:18,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2020-11-30 02:04:18,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466116437] [2020-11-30 02:04:18,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 02:04:18,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 02:04:18,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:04:18,311 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2020-11-30 02:04:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:18,456 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-11-30 02:04:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:04:18,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-11-30 02:04:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:18,459 INFO L225 Difference]: With dead ends: 36 [2020-11-30 02:04:18,459 INFO L226 Difference]: Without dead ends: 32 [2020-11-30 02:04:18,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:04:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-30 02:04:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-30 02:04:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 02:04:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-11-30 02:04:18,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2020-11-30 02:04:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:18,472 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-11-30 02:04:18,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 02:04:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2020-11-30 02:04:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 02:04:18,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:18,476 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:18,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:18,681 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:18,681 INFO L82 PathProgramCache]: Analyzing trace with hash -800351128, now seen corresponding path program 4 times [2020-11-30 02:04:18,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:18,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174985244] [2020-11-30 02:04:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-30 02:04:18,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174985244] [2020-11-30 02:04:18,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007889145] [2020-11-30 02:04:18,865 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:18,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 02:04:18,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-30 02:04:18,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-30 02:04:19,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [708094285] [2020-11-30 02:04:19,735 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:19,735 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:19,735 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:19,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:19,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2020-11-30 02:04:19,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632432010] [2020-11-30 02:04:19,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 02:04:19,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 02:04:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:04:19,738 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 13 states. [2020-11-30 02:04:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:20,022 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-11-30 02:04:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:04:20,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2020-11-30 02:04:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:20,025 INFO L225 Difference]: With dead ends: 41 [2020-11-30 02:04:20,026 INFO L226 Difference]: Without dead ends: 37 [2020-11-30 02:04:20,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:04:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-30 02:04:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-30 02:04:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-30 02:04:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2020-11-30 02:04:20,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2020-11-30 02:04:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:20,045 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-11-30 02:04:20,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 02:04:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2020-11-30 02:04:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-30 02:04:20,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:20,057 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:20,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 02:04:20,264 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 891570168, now seen corresponding path program 5 times [2020-11-30 02:04:20,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:20,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255458573] [2020-11-30 02:04:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-11-30 02:04:20,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255458573] [2020-11-30 02:04:20,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628241434] [2020-11-30 02:04:20,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:20,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2020-11-30 02:04:20,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:20,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:04:20,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2020-11-30 02:04:20,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2020-11-30 02:04:21,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114431565] [2020-11-30 02:04:21,860 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:21,860 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:21,861 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:21,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:21,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2020-11-30 02:04:21,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106739408] [2020-11-30 02:04:21,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 02:04:21,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 02:04:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:04:21,867 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 16 states. [2020-11-30 02:04:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:22,521 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2020-11-30 02:04:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 02:04:22,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2020-11-30 02:04:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:22,525 INFO L225 Difference]: With dead ends: 94 [2020-11-30 02:04:22,525 INFO L226 Difference]: Without dead ends: 58 [2020-11-30 02:04:22,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2020-11-30 02:04:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-30 02:04:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-11-30 02:04:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 02:04:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2020-11-30 02:04:22,570 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 146 [2020-11-30 02:04:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:22,571 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-11-30 02:04:22,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 02:04:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2020-11-30 02:04:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-11-30 02:04:22,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:22,579 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:22,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:22,793 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 136479258, now seen corresponding path program 6 times [2020-11-30 02:04:22,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:22,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068227575] [2020-11-30 02:04:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-11-30 02:04:23,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068227575] [2020-11-30 02:04:23,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640116223] [2020-11-30 02:04:23,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:23,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:04:23,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:23,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 02:04:23,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-11-30 02:04:23,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2020-11-30 02:04:25,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463223317] [2020-11-30 02:04:25,084 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:25,085 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:25,085 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:25,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:25,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2020-11-30 02:04:25,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454619893] [2020-11-30 02:04:25,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 02:04:25,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 02:04:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:04:25,094 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand 17 states. [2020-11-30 02:04:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:25,346 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2020-11-30 02:04:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:04:25,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2020-11-30 02:04:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:25,349 INFO L225 Difference]: With dead ends: 67 [2020-11-30 02:04:25,349 INFO L226 Difference]: Without dead ends: 63 [2020-11-30 02:04:25,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 334 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-11-30 02:04:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-30 02:04:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-30 02:04:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 02:04:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2020-11-30 02:04:25,365 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2020-11-30 02:04:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:25,366 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2020-11-30 02:04:25,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 02:04:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-11-30 02:04:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-11-30 02:04:25,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:25,372 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:25,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:25,593 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1597616503, now seen corresponding path program 7 times [2020-11-30 02:04:25,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:25,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883426853] [2020-11-30 02:04:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-11-30 02:04:26,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883426853] [2020-11-30 02:04:26,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225447359] [2020-11-30 02:04:26,007 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:26,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 02:04:26,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-11-30 02:04:26,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1405 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2020-11-30 02:04:29,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [186823877] [2020-11-30 02:04:29,597 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:29,598 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:29,598 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:29,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:29,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2020-11-30 02:04:29,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982538810] [2020-11-30 02:04:29,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 02:04:29,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 02:04:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-11-30 02:04:29,606 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 19 states. [2020-11-30 02:04:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:30,000 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-11-30 02:04:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:04:30,001 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 323 [2020-11-30 02:04:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:30,004 INFO L225 Difference]: With dead ends: 72 [2020-11-30 02:04:30,005 INFO L226 Difference]: Without dead ends: 68 [2020-11-30 02:04:30,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 633 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-11-30 02:04:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-30 02:04:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-11-30 02:04:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 02:04:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-11-30 02:04:30,020 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 323 [2020-11-30 02:04:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:30,022 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-11-30 02:04:30,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 02:04:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2020-11-30 02:04:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2020-11-30 02:04:30,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:30,038 INFO L422 BasicCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:30,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-30 02:04:30,261 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:30,261 INFO L82 PathProgramCache]: Analyzing trace with hash 417085398, now seen corresponding path program 8 times [2020-11-30 02:04:30,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:30,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256225988] [2020-11-30 02:04:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 397 proven. 2502 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2020-11-30 02:04:30,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256225988] [2020-11-30 02:04:30,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315471451] [2020-11-30 02:04:30,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:31,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2020-11-30 02:04:31,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:31,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:04:31,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1513 proven. 265 refuted. 0 times theorem prover too weak. 12965 trivial. 0 not checked. [2020-11-30 02:04:31,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1513 proven. 299 refuted. 0 times theorem prover too weak. 12931 trivial. 0 not checked. [2020-11-30 02:04:34,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443224493] [2020-11-30 02:04:34,360 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:34,360 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:34,361 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:34,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:34,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 18 [2020-11-30 02:04:34,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95055836] [2020-11-30 02:04:34,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:04:34,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:04:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:04:34,366 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand 18 states. [2020-11-30 02:04:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:34,767 INFO L93 Difference]: Finished difference Result 77 states and 125 transitions. [2020-11-30 02:04:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 02:04:34,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 500 [2020-11-30 02:04:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:34,773 INFO L225 Difference]: With dead ends: 77 [2020-11-30 02:04:34,773 INFO L226 Difference]: Without dead ends: 73 [2020-11-30 02:04:34,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 991 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=450, Unknown=0, NotChecked=0, Total=702 [2020-11-30 02:04:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-30 02:04:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-30 02:04:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 02:04:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2020-11-30 02:04:34,790 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 500 [2020-11-30 02:04:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:34,792 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-30 02:04:34,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:04:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2020-11-30 02:04:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2020-11-30 02:04:34,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:34,809 INFO L422 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:35,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:35,010 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash 186562370, now seen corresponding path program 9 times [2020-11-30 02:04:35,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:35,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310274777] [2020-11-30 02:04:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 2097 proven. 2700 refuted. 0 times theorem prover too weak. 38817 trivial. 0 not checked. [2020-11-30 02:04:36,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310274777] [2020-11-30 02:04:36,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606664826] [2020-11-30 02:04:36,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:36,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:04:36,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:04:36,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 02:04:36,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 21431 proven. 3803 refuted. 0 times theorem prover too weak. 18380 trivial. 0 not checked. [2020-11-30 02:04:37,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:04:37,712 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-11-30 02:04:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 2397 proven. 7237 refuted. 0 times theorem prover too weak. 33980 trivial. 0 not checked. [2020-11-30 02:04:47,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [958264867] [2020-11-30 02:04:47,128 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:04:47,129 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:04:47,129 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:04:47,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:04:47,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 31] total 38 [2020-11-30 02:04:47,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928135892] [2020-11-30 02:04:47,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-30 02:04:47,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:04:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-30 02:04:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2020-11-30 02:04:47,136 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 38 states. [2020-11-30 02:04:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:04:49,694 INFO L93 Difference]: Finished difference Result 212 states and 519 transitions. [2020-11-30 02:04:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-30 02:04:49,695 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 854 [2020-11-30 02:04:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:04:49,697 INFO L225 Difference]: With dead ends: 212 [2020-11-30 02:04:49,697 INFO L226 Difference]: Without dead ends: 130 [2020-11-30 02:04:49,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1758 GetRequests, 1665 SyntacticMatches, 23 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1190, Invalid=3922, Unknown=0, NotChecked=0, Total=5112 [2020-11-30 02:04:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-30 02:04:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2020-11-30 02:04:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-30 02:04:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2020-11-30 02:04:49,716 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 854 [2020-11-30 02:04:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:04:49,717 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2020-11-30 02:04:49,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-30 02:04:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2020-11-30 02:04:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2020-11-30 02:04:49,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:04:49,729 INFO L422 BasicCegarLoop]: trace histogram [151, 151, 122, 75, 75, 75, 75, 75, 75, 75, 47, 29, 1, 1, 1, 1, 1, 1] [2020-11-30 02:04:49,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:04:49,945 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:04:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:04:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2100584703, now seen corresponding path program 10 times [2020-11-30 02:04:49,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:04:49,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364751270] [2020-11-30 02:04:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:04:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 3492 proven. 2362 refuted. 0 times theorem prover too weak. 57927 trivial. 0 not checked. [2020-11-30 02:04:51,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364751270] [2020-11-30 02:04:51,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775137995] [2020-11-30 02:04:51,157 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:04:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:04:51,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 2320 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 02:04:51,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:04:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 4251 proven. 3172 refuted. 0 times theorem prover too weak. 56358 trivial. 0 not checked. [2020-11-30 02:04:52,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:05:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 4251 proven. 3264 refuted. 0 times theorem prover too weak. 56266 trivial. 0 not checked. [2020-11-30 02:05:00,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [910453341] [2020-11-30 02:05:00,004 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:05:00,004 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:05:00,005 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:05:00,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:05:00,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2020-11-30 02:05:00,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48433182] [2020-11-30 02:05:00,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-30 02:05:00,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 02:05:00,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2020-11-30 02:05:00,009 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand 24 states. [2020-11-30 02:05:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:00,458 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2020-11-30 02:05:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 02:05:00,458 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1031 [2020-11-30 02:05:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:00,463 INFO L225 Difference]: With dead ends: 123 [2020-11-30 02:05:00,464 INFO L226 Difference]: Without dead ends: 116 [2020-11-30 02:05:00,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2087 GetRequests, 2041 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2020-11-30 02:05:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-30 02:05:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-11-30 02:05:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-30 02:05:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2020-11-30 02:05:00,477 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 1031 [2020-11-30 02:05:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:00,482 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2020-11-30 02:05:00,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-30 02:05:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2020-11-30 02:05:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2020-11-30 02:05:00,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:00,489 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2020-11-30 02:05:00,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 02:05:00,701 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:05:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1892610110, now seen corresponding path program 11 times [2020-11-30 02:05:00,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:00,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830638823] [2020-11-30 02:05:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-11-30 02:05:02,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830638823] [2020-11-30 02:05:02,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63521628] [2020-11-30 02:05:02,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:05:03,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2020-11-30 02:05:03,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:05:03,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 439 conjunts are in the unsatisfiable core [2020-11-30 02:05:03,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:05:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-11-30 02:05:04,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:05:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-11-30 02:05:15,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094232407] [2020-11-30 02:05:15,186 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:05:15,186 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:05:15,187 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:05:15,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:05:15,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2020-11-30 02:05:15,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253153102] [2020-11-30 02:05:15,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-30 02:05:15,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-30 02:05:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 02:05:15,192 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 36 states. [2020-11-30 02:05:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:15,937 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2020-11-30 02:05:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 02:05:15,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 745 [2020-11-30 02:05:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:15,942 INFO L225 Difference]: With dead ends: 133 [2020-11-30 02:05:15,942 INFO L226 Difference]: Without dead ends: 126 [2020-11-30 02:05:15,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1709 GetRequests, 1591 SyntacticMatches, 84 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 02:05:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-30 02:05:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2020-11-30 02:05:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-30 02:05:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2020-11-30 02:05:15,966 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 745 [2020-11-30 02:05:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:15,974 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2020-11-30 02:05:15,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-30 02:05:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2020-11-30 02:05:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2020-11-30 02:05:15,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:15,985 INFO L422 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1] [2020-11-30 02:05:16,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 02:05:16,209 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:05:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1529543416, now seen corresponding path program 12 times [2020-11-30 02:05:16,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:16,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243784695] [2020-11-30 02:05:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 1106 proven. 4966 refuted. 0 times theorem prover too weak. 37542 trivial. 0 not checked. [2020-11-30 02:05:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243784695] [2020-11-30 02:05:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885242493] [2020-11-30 02:05:17,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/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-11-30 02:05:17,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:05:17,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:05:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 26 conjunts are in the unsatisfiable core [2020-11-30 02:05:17,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:05:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 23181 proven. 1871 refuted. 0 times theorem prover too weak. 18562 trivial. 0 not checked. [2020-11-30 02:05:18,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:05:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 2091 proven. 6674 refuted. 0 times theorem prover too weak. 34849 trivial. 0 not checked. [2020-11-30 02:05:26,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [536873646] [2020-11-30 02:05:26,049 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:05:26,049 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:05:26,050 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:05:26,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:05:26,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 27] total 35 [2020-11-30 02:05:26,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433938865] [2020-11-30 02:05:26,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-11-30 02:05:26,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-30 02:05:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 02:05:26,054 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand 35 states. [2020-11-30 02:05:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:27,104 INFO L93 Difference]: Finished difference Result 242 states and 339 transitions. [2020-11-30 02:05:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 02:05:27,105 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 854 [2020-11-30 02:05:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:27,106 INFO L225 Difference]: With dead ends: 242 [2020-11-30 02:05:27,107 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 02:05:27,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1747 GetRequests, 1676 SyntacticMatches, 19 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=697, Invalid=2165, Unknown=0, NotChecked=0, Total=2862 [2020-11-30 02:05:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 02:05:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 02:05:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 02:05:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 02:05:27,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 854 [2020-11-30 02:05:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:27,113 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 02:05:27,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-11-30 02:05:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 02:05:27,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 02:05:27,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-30 02:05:27,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 02:05:28,416 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 56 [2020-11-30 02:05:28,653 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 8 [2020-11-30 02:05:28,678 INFO L274 CegarLoopResult]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2020-11-30 02:05:28,678 INFO L277 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-11-30 02:05:28,678 INFO L270 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (< 1 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2020-11-30 02:05:28,678 INFO L274 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-11-30 02:05:28,678 INFO L270 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (let ((.cse0 (= |fibonacci_#t~ret7| 1))) (or (<= 10 |fibonacci_#in~n|) (and (<= 13 |fibonacci_#t~ret7|) (<= |fibonacci_#t~ret7| 13) (<= |fibonacci_#in~n| 8) (<= 8 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| 2) .cse0 (< 1 fibonacci_~n)) (and (<= |fibonacci_#in~n| 3) .cse0 (<= 3 |fibonacci_#in~n|)) (and (<= 5 |fibonacci_#in~n|) (<= |fibonacci_#t~ret7| 3) (<= 3 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 5)) (and (<= |fibonacci_#t~ret7| 8) (<= 8 |fibonacci_#t~ret7|) (<= 7 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 7)) (and (<= 9 |fibonacci_#in~n|) (<= |fibonacci_#t~ret7| 21) (<= 21 |fibonacci_#t~ret7|)) (and (<= |fibonacci_#t~ret7| 2) (<= 4 fibonacci_~n) (<= 2 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 4)) (and (<= |fibonacci_#t~ret7| 5) (<= 5 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 6) (<= 6 |fibonacci_#in~n|)))) (<= fibonacci_~n |fibonacci_#in~n|)) [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2020-11-30 02:05:28,679 INFO L274 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-11-30 02:05:28,679 INFO L270 CegarLoopResult]: At program point L27(lines 27 35) the Hoare annotation is: (<= 9 ULTIMATE.start_main_~x~0) [2020-11-30 02:05:28,680 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 02:05:28,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:05:28 BoogieIcfgContainer [2020-11-30 02:05:28,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:05:28,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:05:28,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:05:28,692 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:05:28,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:04:13" (3/4) ... [2020-11-30 02:05:28,695 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 02:05:28,699 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2020-11-30 02:05:28,702 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-11-30 02:05:28,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-30 02:05:28,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 02:05:28,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 02:05:28,735 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81b58d19-93e7-4e9a-8722-a5e421047f10/bin/utaipan/witness.graphml [2020-11-30 02:05:28,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:05:28,736 INFO L168 Benchmark]: Toolchain (without parser) took 76489.21 ms. Allocated memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 64.9 MB in the beginning and 905.8 MB in the end (delta: -840.9 MB). Peak memory consumption was 870.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,736 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 100.7 MB. Free memory is still 80.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:05:28,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.28 ms. Allocated memory is still 100.7 MB. Free memory was 64.7 MB in the beginning and 76.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 100.7 MB. Free memory was 76.9 MB in the beginning and 75.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:05:28,738 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 100.7 MB. Free memory was 75.6 MB in the beginning and 74.8 MB in the end (delta: 842.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,738 INFO L168 Benchmark]: RCFGBuilder took 575.45 ms. Allocated memory is still 100.7 MB. Free memory was 74.4 MB in the beginning and 61.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,739 INFO L168 Benchmark]: TraceAbstraction took 75427.07 ms. Allocated memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 61.4 MB in the beginning and 907.9 MB in the end (delta: -846.5 MB). Peak memory consumption was 867.0 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,739 INFO L168 Benchmark]: Witness Printer took 42.95 ms. Allocated memory is still 1.8 GB. Free memory was 907.9 MB in the beginning and 905.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:05:28,742 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.31 ms. Allocated memory is still 100.7 MB. Free memory is still 80.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 354.28 ms. Allocated memory is still 100.7 MB. Free memory was 64.7 MB in the beginning and 76.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 100.7 MB. Free memory was 76.9 MB in the beginning and 75.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.91 ms. Allocated memory is still 100.7 MB. Free memory was 75.6 MB in the beginning and 74.8 MB in the end (delta: 842.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 575.45 ms. Allocated memory is still 100.7 MB. Free memory was 74.4 MB in the beginning and 61.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 75427.07 ms. Allocated memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 61.4 MB in the beginning and 907.9 MB in the end (delta: -846.5 MB). Peak memory consumption was 867.0 MB. Max. memory is 16.1 GB. * Witness Printer took 42.95 ms. Allocated memory is still 1.8 GB. Free memory was 907.9 MB in the beginning and 905.8 MB 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: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 9 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 73.9s, OverallIterations: 15, TraceHistogramMax: 151, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 309 SDtfs, 1424 SDslu, 1960 SDs, 0 SdLazy, 3447 SolverSat, 2101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10111 GetRequests, 9552 SyntacticMatches, 198 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 221 PreInvPairs, 370 NumberOfFragments, 127 HoareAnnotationTreeSize, 221 FomulaSimplifications, 1378 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3342 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 55.0s InterpolantComputationTime, 9635 NumberOfCodeBlocks, 9009 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 14402 ConstructedInterpolants, 0 QuantifiedInterpolants, 15963410 SizeOfPredicates, 85 NumberOfNonLiveVariables, 9431 ConjunctsInSsa, 601 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 545609/624024 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...