./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8 --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 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:57:53,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:57:53,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:57:53,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:57:53,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:57:53,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:57:53,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:57:53,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:57:53,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:57:53,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:57:53,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:57:53,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:57:53,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:57:53,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:57:53,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:57:53,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:57:53,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:57:53,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:57:53,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:57:53,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:57:53,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:57:53,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:57:53,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:57:53,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:57:53,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:57:53,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:57:53,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:57:53,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:57:53,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:57:53,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:57:53,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:57:53,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:57:53,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:57:53,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:57:53,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:57:53,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:57:53,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:57:53,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:57:53,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:57:53,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:57:53,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:57:53,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 00:57:53,608 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:57:53,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:57:53,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:57:53,614 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:57:53,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:57:53,615 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:57:53,615 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:57:53,615 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:57:53,616 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:57:53,616 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:57:53,618 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:57:53,619 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:57:53,620 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:57:53,620 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:57:53,620 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:57:53,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:57:53,622 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:57:53,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:57:53,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:57:53,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:57:53,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:57:53,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:57:53,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:57:53,625 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:57:53,626 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:57:53,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:57:53,627 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:57:53,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:57:53,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:57:53,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:57:53,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:57:53,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:57:53,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:57:53,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:57:53,634 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:57:53,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:57:53,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:57:53,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:57:53,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:57:53,636 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8 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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2021-11-07 00:57:54,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:57:54,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:57:54,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:57:54,241 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:57:54,243 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:57:54,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2021-11-07 00:57:54,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/data/f6f77570a/574485e9156b482598f65520b837d244/FLAG3e4cb7a74 [2021-11-07 00:57:55,153 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:57:55,155 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2021-11-07 00:57:55,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/data/f6f77570a/574485e9156b482598f65520b837d244/FLAG3e4cb7a74 [2021-11-07 00:57:55,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/data/f6f77570a/574485e9156b482598f65520b837d244 [2021-11-07 00:57:55,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:57:55,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:57:55,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:57:55,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:57:55,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:57:55,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e7d7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55, skipping insertion in model container [2021-11-07 00:57:55,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:57:55,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:57:55,834 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/sv-benchmarks/c/recursive-simple/sum_20x0-1.c[481,494] [2021-11-07 00:57:55,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:57:55,865 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:57:55,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/sv-benchmarks/c/recursive-simple/sum_20x0-1.c[481,494] [2021-11-07 00:57:55,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:57:55,915 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:57:55,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55 WrapperNode [2021-11-07 00:57:55,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:57:55,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:57:55,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:57:55,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:57:55,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:57:55,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:57:55,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:57:55,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:57:55,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:55,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:57:56,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:57:56,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:57:56,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:57:56,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2021-11-07 00:57:56,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:57:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:57:56,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:57:56,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:57:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:57:56,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:57:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-11-07 00:57:56,189 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-11-07 00:57:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:57:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:57:56,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:57:56,625 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 00:57:56,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:56 BoogieIcfgContainer [2021-11-07 00:57:56,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:57:56,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:57:56,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:57:56,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:57:56,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:55" (1/3) ... [2021-11-07 00:57:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783eeea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:56, skipping insertion in model container [2021-11-07 00:57:56,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (2/3) ... [2021-11-07 00:57:56,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783eeea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:56, skipping insertion in model container [2021-11-07 00:57:56,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:56" (3/3) ... [2021-11-07 00:57:56,650 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2021-11-07 00:57:56,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:57:56,666 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 00:57:56,741 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:57:56,752 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:57:56,753 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 00:57:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-07 00:57:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 00:57:56,790 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:56,791 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:56,792 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:57:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2021-11-07 00:57:56,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:56,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910254694] [2021-11-07 00:57:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:56,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:57:57,240 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:57,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910254694] [2021-11-07 00:57:57,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910254694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:57:57,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:57:57,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:57:57,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211679535] [2021-11-07 00:57:57,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 00:57:57,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 00:57:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 00:57:57,301 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 00:57:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:57,404 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-07 00:57:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 00:57:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-07 00:57:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:57,422 INFO L225 Difference]: With dead ends: 22 [2021-11-07 00:57:57,423 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 00:57:57,427 INFO L786 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 [2021-11-07 00:57:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 00:57:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 00:57:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 00:57:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-07 00:57:57,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-11-07 00:57:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:57,527 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-07 00:57:57,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 00:57:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-07 00:57:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 00:57:57,541 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:57,542 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:57,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:57:57,543 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:57:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2021-11-07 00:57:57,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:57,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995368079] [2021-11-07 00:57:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:57,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 00:57:57,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:57,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995368079] [2021-11-07 00:57:57,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995368079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:57:57,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93799956] [2021-11-07 00:57:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:57,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:57:57,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:57:57,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:57:57,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 00:57:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:57,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 00:57:57,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:57:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 00:57:58,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:57:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 00:57:58,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93799956] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:57:58,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237095321] [2021-11-07 00:57:58,677 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:57:58,677 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:57:58,687 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:57:58,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:57:58,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-11-07 00:57:58,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484584783] [2021-11-07 00:57:58,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 00:57:58,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:57:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 00:57:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-07 00:57:58,700 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 00:57:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:57:58,801 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-11-07 00:57:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:57:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2021-11-07 00:57:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:57:58,808 INFO L225 Difference]: With dead ends: 21 [2021-11-07 00:57:58,813 INFO L226 Difference]: Without dead ends: 17 [2021-11-07 00:57:58,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-07 00:57:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-07 00:57:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-07 00:57:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-07 00:57:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-07 00:57:58,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-11-07 00:57:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:57:58,843 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-07 00:57:58,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 00:57:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-07 00:57:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 00:57:58,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:57:58,847 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:57:58,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 00:57:59,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:57:59,049 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:57:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:57:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2021-11-07 00:57:59,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:57:59,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345149870] [2021-11-07 00:57:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:57:59,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:57:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:57:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 00:57:59,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:57:59,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345149870] [2021-11-07 00:57:59,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345149870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:57:59,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51710499] [2021-11-07 00:57:59,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 00:57:59,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:57:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:57:59,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:57:59,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 00:57:59,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-07 00:57:59,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:57:59,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 00:57:59,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:57:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 00:57:59,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 00:58:00,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51710499] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:00,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440335947] [2021-11-07 00:58:00,294 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:00,294 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:00,295 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:00,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:00,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-11-07 00:58:00,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317007837] [2021-11-07 00:58:00,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 00:58:00,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 00:58:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-07 00:58:00,311 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-07 00:58:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:00,420 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-11-07 00:58:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 00:58:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2021-11-07 00:58:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:00,423 INFO L225 Difference]: With dead ends: 24 [2021-11-07 00:58:00,423 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 00:58:00,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-07 00:58:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 00:58:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-07 00:58:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-07 00:58:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-11-07 00:58:00,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2021-11-07 00:58:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:00,446 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-11-07 00:58:00,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-07 00:58:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-11-07 00:58:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 00:58:00,451 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:00,451 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:00,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:00,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:00,667 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2021-11-07 00:58:00,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:00,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817518095] [2021-11-07 00:58:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:00,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-07 00:58:00,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:00,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817518095] [2021-11-07 00:58:00,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817518095] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:00,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200520028] [2021-11-07 00:58:00,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 00:58:00,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:00,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:00,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 00:58:01,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 00:58:01,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:01,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 00:58:01,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-07 00:58:01,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 00:58:02,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200520028] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:02,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144040374] [2021-11-07 00:58:02,014 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:02,015 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:02,016 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:02,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:02,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-11-07 00:58:02,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109210311] [2021-11-07 00:58:02,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 00:58:02,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:02,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 00:58:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-07 00:58:02,024 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-07 00:58:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:02,154 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-11-07 00:58:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 00:58:02,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 27 [2021-11-07 00:58:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:02,158 INFO L225 Difference]: With dead ends: 27 [2021-11-07 00:58:02,158 INFO L226 Difference]: Without dead ends: 23 [2021-11-07 00:58:02,159 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:58:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-07 00:58:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-07 00:58:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-07 00:58:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-07 00:58:02,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2021-11-07 00:58:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:02,169 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-07 00:58:02,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-07 00:58:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-07 00:58:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 00:58:02,172 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:02,173 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:02,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:02,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:02,390 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2021-11-07 00:58:02,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:02,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619414799] [2021-11-07 00:58:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:02,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-07 00:58:02,615 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:02,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619414799] [2021-11-07 00:58:02,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619414799] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:02,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672922665] [2021-11-07 00:58:02,623 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 00:58:02,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:02,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:02,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:02,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 00:58:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:02,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 00:58:02,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-07 00:58:02,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 00:58:04,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672922665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:04,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864533230] [2021-11-07 00:58:04,222 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:04,222 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:04,223 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:04,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:04,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2021-11-07 00:58:04,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748945783] [2021-11-07 00:58:04,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 00:58:04,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 00:58:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-07 00:58:04,229 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-07 00:58:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:04,368 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-11-07 00:58:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 00:58:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2021-11-07 00:58:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:04,371 INFO L225 Difference]: With dead ends: 30 [2021-11-07 00:58:04,371 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 00:58:04,372 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-11-07 00:58:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 00:58:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-07 00:58:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-07 00:58:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-11-07 00:58:04,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2021-11-07 00:58:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:04,382 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-07 00:58:04,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-07 00:58:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-11-07 00:58:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 00:58:04,385 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:04,385 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:04,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:04,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:04,598 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2021-11-07 00:58:04,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:04,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673771206] [2021-11-07 00:58:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:04,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-07 00:58:04,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:04,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673771206] [2021-11-07 00:58:04,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673771206] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:04,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770148966] [2021-11-07 00:58:04,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 00:58:04,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:04,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:04,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 00:58:05,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-07 00:58:05,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:05,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 00:58:05,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-07 00:58:05,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-07 00:58:07,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770148966] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:07,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2057619138] [2021-11-07 00:58:07,169 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:07,170 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:07,170 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:07,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:07,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2021-11-07 00:58:07,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826902174] [2021-11-07 00:58:07,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 00:58:07,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:07,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 00:58:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-11-07 00:58:07,175 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2021-11-07 00:58:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:07,350 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2021-11-07 00:58:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 00:58:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2021-11-07 00:58:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:07,353 INFO L225 Difference]: With dead ends: 33 [2021-11-07 00:58:07,356 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 00:58:07,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-11-07 00:58:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 00:58:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-07 00:58:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-07 00:58:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-11-07 00:58:07,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2021-11-07 00:58:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:07,365 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-11-07 00:58:07,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2021-11-07 00:58:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-11-07 00:58:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 00:58:07,368 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:07,368 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:07,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:07,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-07 00:58:07,574 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2021-11-07 00:58:07,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:07,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124540744] [2021-11-07 00:58:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:07,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-07 00:58:07,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:07,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124540744] [2021-11-07 00:58:07,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124540744] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:07,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950474037] [2021-11-07 00:58:07,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 00:58:07,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:07,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:07,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:07,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 00:58:08,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 00:58:08,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:08,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 00:58:08,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-07 00:58:08,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-07 00:58:10,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950474037] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:10,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781622753] [2021-11-07 00:58:10,901 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:10,902 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:10,902 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:10,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:10,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2021-11-07 00:58:10,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894265259] [2021-11-07 00:58:10,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 00:58:10,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 00:58:10,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-07 00:58:10,916 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2021-11-07 00:58:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:11,148 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-11-07 00:58:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 00:58:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 45 [2021-11-07 00:58:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:11,152 INFO L225 Difference]: With dead ends: 36 [2021-11-07 00:58:11,152 INFO L226 Difference]: Without dead ends: 32 [2021-11-07 00:58:11,153 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-11-07 00:58:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-07 00:58:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-07 00:58:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-07 00:58:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-11-07 00:58:11,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2021-11-07 00:58:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:11,180 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-11-07 00:58:11,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2021-11-07 00:58:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-11-07 00:58:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 00:58:11,188 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:11,189 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:11,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:11,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:11,402 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2021-11-07 00:58:11,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:11,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152860183] [2021-11-07 00:58:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:11,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-07 00:58:11,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:11,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152860183] [2021-11-07 00:58:11,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152860183] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:11,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993010834] [2021-11-07 00:58:11,641 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 00:58:11,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:11,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:11,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 00:58:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:12,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 00:58:12,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-07 00:58:12,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 00:58:15,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993010834] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:15,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926387464] [2021-11-07 00:58:15,276 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:15,276 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:15,277 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:15,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:15,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2021-11-07 00:58:15,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480210004] [2021-11-07 00:58:15,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-07 00:58:15,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-07 00:58:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-11-07 00:58:15,282 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-07 00:58:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:15,456 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-11-07 00:58:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 00:58:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 51 [2021-11-07 00:58:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:15,459 INFO L225 Difference]: With dead ends: 39 [2021-11-07 00:58:15,459 INFO L226 Difference]: Without dead ends: 35 [2021-11-07 00:58:15,460 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:58:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-07 00:58:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-11-07 00:58:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-07 00:58:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-11-07 00:58:15,475 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2021-11-07 00:58:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:15,476 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-11-07 00:58:15,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-07 00:58:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-11-07 00:58:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-07 00:58:15,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:15,482 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:15,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:15,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:15,701 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2021-11-07 00:58:15,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:15,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366094620] [2021-11-07 00:58:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:15,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-07 00:58:15,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:15,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366094620] [2021-11-07 00:58:15,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366094620] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:15,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360876510] [2021-11-07 00:58:15,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 00:58:15,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:15,981 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:15,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 00:58:16,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-07 00:58:16,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:16,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-07 00:58:16,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-07 00:58:17,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-07 00:58:24,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360876510] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:24,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860100998] [2021-11-07 00:58:24,612 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:24,613 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:24,613 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:24,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:24,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 36 [2021-11-07 00:58:24,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026882269] [2021-11-07 00:58:24,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-07 00:58:24,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:24,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-07 00:58:24,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 00:58:24,620 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-07 00:58:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:25,409 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-11-07 00:58:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 00:58:25,412 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) Word has length 57 [2021-11-07 00:58:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:25,414 INFO L225 Difference]: With dead ends: 42 [2021-11-07 00:58:25,414 INFO L226 Difference]: Without dead ends: 38 [2021-11-07 00:58:25,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 [2021-11-07 00:58:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-07 00:58:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-07 00:58:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-07 00:58:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-11-07 00:58:25,428 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2021-11-07 00:58:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:25,429 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-11-07 00:58:25,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-07 00:58:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-11-07 00:58:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 00:58:25,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:25,432 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:25,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:25,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:25,651 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2021-11-07 00:58:25,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:25,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280300908] [2021-11-07 00:58:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:25,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-07 00:58:25,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:25,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280300908] [2021-11-07 00:58:25,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280300908] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:25,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832506012] [2021-11-07 00:58:25,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 00:58:25,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:25,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:25,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:25,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 00:58:26,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 00:58:26,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:26,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 00:58:26,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-07 00:58:26,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-07 00:58:31,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832506012] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:31,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549551318] [2021-11-07 00:58:31,930 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:31,930 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:31,931 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:31,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:31,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2021-11-07 00:58:31,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794978427] [2021-11-07 00:58:31,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 00:58:31,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 00:58:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-11-07 00:58:31,940 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2021-11-07 00:58:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:32,198 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-11-07 00:58:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 00:58:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) Word has length 63 [2021-11-07 00:58:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:32,202 INFO L225 Difference]: With dead ends: 45 [2021-11-07 00:58:32,202 INFO L226 Difference]: Without dead ends: 41 [2021-11-07 00:58:32,204 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 00:58:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-07 00:58:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-11-07 00:58:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-07 00:58:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-11-07 00:58:32,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2021-11-07 00:58:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:32,215 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-11-07 00:58:32,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2021-11-07 00:58:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-11-07 00:58:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 00:58:32,219 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:32,219 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:32,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:32,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:32,440 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2021-11-07 00:58:32,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:32,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182379941] [2021-11-07 00:58:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:32,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-11-07 00:58:32,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:32,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182379941] [2021-11-07 00:58:32,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182379941] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:32,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792725424] [2021-11-07 00:58:32,713 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 00:58:32,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:32,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:32,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:32,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-07 00:58:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:33,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-07 00:58:33,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-11-07 00:58:33,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-07 00:58:39,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792725424] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:39,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072315301] [2021-11-07 00:58:39,362 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:39,363 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:39,363 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:39,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:39,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2021-11-07 00:58:39,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619710396] [2021-11-07 00:58:39,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-07 00:58:39,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-07 00:58:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2021-11-07 00:58:39,370 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-11-07 00:58:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:39,713 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-11-07 00:58:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 00:58:39,714 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 69 [2021-11-07 00:58:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:39,716 INFO L225 Difference]: With dead ends: 48 [2021-11-07 00:58:39,716 INFO L226 Difference]: Without dead ends: 44 [2021-11-07 00:58:39,717 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 00:58:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-07 00:58:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-07 00:58:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-07 00:58:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-11-07 00:58:39,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2021-11-07 00:58:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:39,735 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-11-07 00:58:39,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-11-07 00:58:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-11-07 00:58:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 00:58:39,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:39,738 INFO L513 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:39,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:39,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 00:58:39,950 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2021-11-07 00:58:39,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:39,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302975856] [2021-11-07 00:58:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:39,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-11-07 00:58:40,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:40,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302975856] [2021-11-07 00:58:40,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302975856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:40,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139391084] [2021-11-07 00:58:40,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 00:58:40,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:40,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:40,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:40,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-07 00:58:41,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-11-07 00:58:41,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:41,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-07 00:58:41,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-11-07 00:58:41,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-07 00:58:48,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139391084] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:48,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [779863628] [2021-11-07 00:58:48,573 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:48,573 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:48,573 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:48,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:48,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2021-11-07 00:58:48,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451091208] [2021-11-07 00:58:48,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-07 00:58:48,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-07 00:58:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-11-07 00:58:48,579 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2021-11-07 00:58:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:48,888 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2021-11-07 00:58:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 00:58:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) Word has length 75 [2021-11-07 00:58:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:48,890 INFO L225 Difference]: With dead ends: 51 [2021-11-07 00:58:48,890 INFO L226 Difference]: Without dead ends: 47 [2021-11-07 00:58:48,892 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 00:58:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-07 00:58:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-07 00:58:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-07 00:58:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-11-07 00:58:48,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2021-11-07 00:58:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:48,901 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-11-07 00:58:48,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2021-11-07 00:58:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-11-07 00:58:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-07 00:58:48,904 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:48,904 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:48,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-07 00:58:49,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:49,120 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2021-11-07 00:58:49,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:49,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599800804] [2021-11-07 00:58:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:49,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-11-07 00:58:49,455 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:49,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599800804] [2021-11-07 00:58:49,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599800804] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:49,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454174424] [2021-11-07 00:58:49,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 00:58:49,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:49,458 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:49,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-07 00:58:50,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 00:58:50,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:58:50,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-07 00:58:50,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-11-07 00:58:50,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-07 00:58:59,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454174424] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:58:59,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [766922335] [2021-11-07 00:58:59,500 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:58:59,501 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:58:59,501 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:58:59,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:58:59,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2021-11-07 00:58:59,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606181168] [2021-11-07 00:58:59,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-07 00:58:59,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-07 00:58:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2021-11-07 00:58:59,505 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-11-07 00:58:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:59,830 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-11-07 00:58:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 00:58:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 81 [2021-11-07 00:58:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:59,832 INFO L225 Difference]: With dead ends: 54 [2021-11-07 00:58:59,832 INFO L226 Difference]: Without dead ends: 50 [2021-11-07 00:58:59,833 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 00:58:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-07 00:58:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-11-07 00:58:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-07 00:58:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-11-07 00:58:59,848 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2021-11-07 00:58:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:59,849 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-11-07 00:58:59,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-11-07 00:58:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-11-07 00:58:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-07 00:58:59,853 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:59,853 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:59,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-07 00:59:00,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:00,078 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:59:00,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2021-11-07 00:59:00,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:00,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941334668] [2021-11-07 00:59:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:00,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-11-07 00:59:00,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:00,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941334668] [2021-11-07 00:59:00,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941334668] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:59:00,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208149312] [2021-11-07 00:59:00,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 00:59:00,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:59:00,414 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:59:00,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-07 00:59:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:01,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 00:59:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:59:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-11-07 00:59:01,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:59:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-07 00:59:13,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208149312] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:59:13,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314137164] [2021-11-07 00:59:13,014 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:59:13,014 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:59:13,014 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:59:13,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:59:13,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2021-11-07 00:59:13,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490749283] [2021-11-07 00:59:13,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-07 00:59:13,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-07 00:59:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 00:59:13,019 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2021-11-07 00:59:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:13,352 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-11-07 00:59:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 00:59:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) Word has length 87 [2021-11-07 00:59:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:13,358 INFO L225 Difference]: With dead ends: 57 [2021-11-07 00:59:13,358 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 00:59:13,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2021-11-07 00:59:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 00:59:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-07 00:59:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-07 00:59:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-11-07 00:59:13,371 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2021-11-07 00:59:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:13,372 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-11-07 00:59:13,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2021-11-07 00:59:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-11-07 00:59:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 00:59:13,374 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:13,374 INFO L513 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:13,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-07 00:59:13,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-07 00:59:13,575 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:59:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2021-11-07 00:59:13,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:13,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838007470] [2021-11-07 00:59:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:13,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-07 00:59:13,904 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:13,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838007470] [2021-11-07 00:59:13,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838007470] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:59:13,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200716175] [2021-11-07 00:59:13,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 00:59:13,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:13,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:59:13,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:59:13,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-07 00:59:15,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-11-07 00:59:15,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:59:15,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-07 00:59:15,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:59:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-07 00:59:15,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:59:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-07 00:59:29,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200716175] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:59:29,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [389423083] [2021-11-07 00:59:29,512 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:59:29,512 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:59:29,513 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:59:29,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:59:29,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2021-11-07 00:59:29,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257986922] [2021-11-07 00:59:29,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-07 00:59:29,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-07 00:59:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 00:59:29,518 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2021-11-07 00:59:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:29,990 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-11-07 00:59:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 00:59:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) Word has length 93 [2021-11-07 00:59:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:29,992 INFO L225 Difference]: With dead ends: 60 [2021-11-07 00:59:29,992 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 00:59:29,994 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2021-11-07 00:59:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 00:59:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-07 00:59:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-07 00:59:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-11-07 00:59:30,016 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2021-11-07 00:59:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:30,017 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-11-07 00:59:30,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2021-11-07 00:59:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-11-07 00:59:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-07 00:59:30,023 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:30,024 INFO L513 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:30,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-07 00:59:30,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 00:59:30,242 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:59:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:30,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2021-11-07 00:59:30,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:30,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105693010] [2021-11-07 00:59:30,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:30,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-11-07 00:59:30,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:30,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105693010] [2021-11-07 00:59:30,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105693010] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:59:30,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10973602] [2021-11-07 00:59:30,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 00:59:30,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:59:30,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:59:30,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-07 00:59:32,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 00:59:32,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 00:59:32,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 00:59:32,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:59:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-11-07 00:59:32,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:59:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-07 00:59:48,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10973602] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 00:59:48,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725394187] [2021-11-07 00:59:48,926 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 00:59:48,927 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 00:59:48,927 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 00:59:48,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 00:59:48,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2021-11-07 00:59:48,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433170423] [2021-11-07 00:59:48,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-07 00:59:48,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:59:48,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-07 00:59:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 00:59:48,934 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2021-11-07 00:59:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:59:49,383 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2021-11-07 00:59:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 00:59:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) Word has length 99 [2021-11-07 00:59:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:59:49,385 INFO L225 Difference]: With dead ends: 63 [2021-11-07 00:59:49,386 INFO L226 Difference]: Without dead ends: 59 [2021-11-07 00:59:49,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2021-11-07 00:59:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-07 00:59:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-07 00:59:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-07 00:59:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-11-07 00:59:49,396 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2021-11-07 00:59:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:59:49,397 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-11-07 00:59:49,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2021-11-07 00:59:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-11-07 00:59:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-07 00:59:49,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:59:49,401 INFO L513 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:59:49,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-07 00:59:49,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:49,626 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:59:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:59:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1678126652, now seen corresponding path program 16 times [2021-11-07 00:59:49,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:59:49,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547608914] [2021-11-07 00:59:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:59:49,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:59:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-11-07 00:59:50,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:59:50,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547608914] [2021-11-07 00:59:50,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547608914] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:59:50,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067747658] [2021-11-07 00:59:50,013 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 00:59:50,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:59:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:59:50,014 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:59:50,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-07 00:59:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:59:51,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-07 00:59:51,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:59:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-11-07 00:59:51,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-11-07 01:00:10,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067747658] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:10,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1752739689] [2021-11-07 01:00:10,143 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 01:00:10,143 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:10,144 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:10,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:10,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2021-11-07 01:00:10,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833093195] [2021-11-07 01:00:10,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-07 01:00:10,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:10,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-07 01:00:10,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 01:00:10,149 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2021-11-07 01:00:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:10,682 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-11-07 01:00:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:00:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) Word has length 105 [2021-11-07 01:00:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:10,684 INFO L225 Difference]: With dead ends: 66 [2021-11-07 01:00:10,684 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:00:10,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2021-11-07 01:00:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:00:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-07 01:00:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-07 01:00:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-11-07 01:00:10,693 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2021-11-07 01:00:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:10,693 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-11-07 01:00:10,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2021-11-07 01:00:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-11-07 01:00:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-07 01:00:10,696 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:10,696 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:10,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:10,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-07 01:00:10,922 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -543729842, now seen corresponding path program 17 times [2021-11-07 01:00:10,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:10,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454360276] [2021-11-07 01:00:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:10,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-11-07 01:00:11,397 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:11,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454360276] [2021-11-07 01:00:11,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454360276] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:11,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126987461] [2021-11-07 01:00:11,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:00:11,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:11,405 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:11,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-07 01:00:14,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2021-11-07 01:00:14,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:00:14,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-07 01:00:14,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-11-07 01:00:15,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-11-07 01:00:36,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126987461] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:36,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1134959084] [2021-11-07 01:00:36,803 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 01:00:36,804 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:36,804 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:36,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:36,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2021-11-07 01:00:36,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121896052] [2021-11-07 01:00:36,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-07 01:00:36,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:36,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-07 01:00:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 01:00:36,821 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2021-11-07 01:00:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:37,331 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2021-11-07 01:00:37,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:00:37,332 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) Word has length 111 [2021-11-07 01:00:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:37,336 INFO L225 Difference]: With dead ends: 69 [2021-11-07 01:00:37,336 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:00:37,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2021-11-07 01:00:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:00:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-07 01:00:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-07 01:00:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-11-07 01:00:37,345 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2021-11-07 01:00:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:37,346 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-11-07 01:00:37,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2021-11-07 01:00:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-11-07 01:00:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-07 01:00:37,348 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:37,348 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:37,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:37,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 01:00:37,558 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1011974276, now seen corresponding path program 18 times [2021-11-07 01:00:37,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:37,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484906704] [2021-11-07 01:00:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:37,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-11-07 01:00:38,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484906704] [2021-11-07 01:00:38,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484906704] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:38,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427042075] [2021-11-07 01:00:38,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:00:38,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:38,022 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:38,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-07 01:00:40,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:00:40,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:00:40,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-07 01:00:40,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-11-07 01:00:41,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:01:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-11-07 01:01:08,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427042075] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:01:08,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573250252] [2021-11-07 01:01:08,802 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 01:01:08,802 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:01:08,802 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:01:08,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:01:08,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2021-11-07 01:01:08,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998777435] [2021-11-07 01:01:08,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-07 01:01:08,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-07 01:01:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2021-11-07 01:01:08,810 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2021-11-07 01:01:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:09,351 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2021-11-07 01:01:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 01:01:09,352 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) Word has length 117 [2021-11-07 01:01:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:09,353 INFO L225 Difference]: With dead ends: 72 [2021-11-07 01:01:09,353 INFO L226 Difference]: Without dead ends: 68 [2021-11-07 01:01:09,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2021-11-07 01:01:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-07 01:01:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-07 01:01:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-07 01:01:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-11-07 01:01:09,360 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2021-11-07 01:01:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:09,361 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-11-07 01:01:09,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2021-11-07 01:01:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-11-07 01:01:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-07 01:01:09,363 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:09,363 INFO L513 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:09,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-07 01:01:09,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:01:09,574 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:01:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 486282894, now seen corresponding path program 19 times [2021-11-07 01:01:09,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:09,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41774332] [2021-11-07 01:01:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:09,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-11-07 01:01:10,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:01:10,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41774332] [2021-11-07 01:01:10,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41774332] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:01:10,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113781658] [2021-11-07 01:01:10,042 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:01:10,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:01:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:01:10,050 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:01:10,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-07 01:01:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:01:13,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-07 01:01:13,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:01:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-11-07 01:01:14,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:01:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-07 01:01:42,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113781658] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:01:42,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295938340] [2021-11-07 01:01:42,266 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-07 01:01:42,266 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:01:42,267 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:01:42,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:01:42,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 44 [2021-11-07 01:01:42,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056556882] [2021-11-07 01:01:42,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-07 01:01:42,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:01:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-07 01:01:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 01:01:42,274 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 44 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 20 states have return successors, (39), 20 states have call predecessors, (39), 21 states have call successors, (39) [2021-11-07 01:01:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:01:43,013 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2021-11-07 01:01:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 01:01:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 20 states have return successors, (39), 20 states have call predecessors, (39), 21 states have call successors, (39) Word has length 123 [2021-11-07 01:01:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:01:43,020 INFO L225 Difference]: With dead ends: 75 [2021-11-07 01:01:43,021 INFO L226 Difference]: Without dead ends: 71 [2021-11-07 01:01:43,023 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1365, Invalid=2667, Unknown=0, NotChecked=0, Total=4032 [2021-11-07 01:01:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-07 01:01:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-07 01:01:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-07 01:01:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-11-07 01:01:43,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2021-11-07 01:01:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:01:43,030 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-11-07 01:01:43,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0) internal successors, (86), 43 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 20 states have return successors, (39), 20 states have call predecessors, (39), 21 states have call successors, (39) [2021-11-07 01:01:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-11-07 01:01:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 01:01:43,033 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:01:43,033 INFO L513 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:01:43,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-07 01:01:43,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:01:43,238 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:01:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:01:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 20 times [2021-11-07 01:01:43,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:01:43,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888710194] [2021-11-07 01:01:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:01:43,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:01:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:01:43,454 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:01:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:01:43,683 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:01:43,683 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:01:43,686 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:01:43,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 01:01:43,696 INFO L731 BasicCegarLoop]: Path program histogram: [20, 1] [2021-11-07 01:01:43,703 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:01:43,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:01:43 BoogieIcfgContainer [2021-11-07 01:01:43,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:01:43,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:01:43,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:01:43,886 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:01:43,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:56" (3/4) ... [2021-11-07 01:01:43,890 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:01:44,051 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:01:44,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:01:44,055 INFO L168 Benchmark]: Toolchain (without parser) took 228559.14 ms. Allocated memory was 90.2 MB in the beginning and 474.0 MB in the end (delta: 383.8 MB). Free memory was 53.1 MB in the beginning and 255.8 MB in the end (delta: -202.6 MB). Peak memory consumption was 179.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,056 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 90.2 MB. Free memory is still 69.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:01:44,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.92 ms. Allocated memory was 90.2 MB in the beginning and 130.0 MB in the end (delta: 39.8 MB). Free memory was 52.9 MB in the beginning and 105.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.26 ms. Allocated memory is still 130.0 MB. Free memory was 105.8 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,059 INFO L168 Benchmark]: Boogie Preprocessor took 54.21 ms. Allocated memory is still 130.0 MB. Free memory was 104.6 MB in the beginning and 103.7 MB in the end (delta: 868.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:01:44,060 INFO L168 Benchmark]: RCFGBuilder took 597.06 ms. Allocated memory is still 130.0 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,061 INFO L168 Benchmark]: TraceAbstraction took 227251.09 ms. Allocated memory was 130.0 MB in the beginning and 474.0 MB in the end (delta: 343.9 MB). Free memory was 93.3 MB in the beginning and 262.0 MB in the end (delta: -168.7 MB). Peak memory consumption was 176.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,062 INFO L168 Benchmark]: Witness Printer took 166.31 ms. Allocated memory is still 474.0 MB. Free memory was 262.0 MB in the beginning and 255.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:01:44,066 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.50 ms. Allocated memory is still 90.2 MB. Free memory is still 69.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 419.92 ms. Allocated memory was 90.2 MB in the beginning and 130.0 MB in the end (delta: 39.8 MB). Free memory was 52.9 MB in the beginning and 105.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.26 ms. Allocated memory is still 130.0 MB. Free memory was 105.8 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.21 ms. Allocated memory is still 130.0 MB. Free memory was 104.6 MB in the beginning and 103.7 MB in the end (delta: 868.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 597.06 ms. Allocated memory is still 130.0 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 227251.09 ms. Allocated memory was 130.0 MB in the beginning and 474.0 MB in the end (delta: 343.9 MB). Free memory was 93.3 MB in the beginning and 262.0 MB in the end (delta: -168.7 MB). Peak memory consumption was 176.4 MB. Max. memory is 16.1 GB. * Witness Printer took 166.31 ms. Allocated memory is still 474.0 MB. Free memory was 262.0 MB in the beginning and 255.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 20; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 226.9s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 160 SDtfs, 3662 SDslu, 1287 SDs, 0 SdLazy, 1595 SolverSat, 1679 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3283 GetRequests, 2572 SyntacticMatches, 2 SemanticMatches, 709 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4539 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, InterpolantAutomatonStates: 298, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 192.4s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 3884 ConstructedInterpolants, 0 QuantifiedInterpolants, 11696 SizeOfPredicates, 214 NumberOfNonLiveVariables, 4522 ConjunctsInSsa, 476 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 8994/22800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:01:44,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd5ccc00-270b-4a27-8d40-fd3b8b8465a7/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE