./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a71ed7b24cb625c47cfb1b6ba9f6cdbf2879f063 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 03:03:21,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 03:03:21,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 03:03:21,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 03:03:21,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 03:03:21,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 03:03:21,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 03:03:21,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 03:03:21,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 03:03:21,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 03:03:21,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 03:03:21,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 03:03:21,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 03:03:21,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 03:03:21,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 03:03:21,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 03:03:21,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 03:03:21,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 03:03:21,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 03:03:21,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 03:03:21,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 03:03:21,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 03:03:21,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 03:03:21,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 03:03:21,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 03:03:21,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 03:03:21,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 03:03:21,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 03:03:21,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 03:03:21,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 03:03:21,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 03:03:21,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 03:03:21,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 03:03:21,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 03:03:21,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 03:03:21,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 03:03:21,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 03:03:21,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 03:03:21,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 03:03:21,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 03:03:21,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 03:03:21,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-16 03:03:21,646 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 03:03:21,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 03:03:21,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 03:03:21,655 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 03:03:21,655 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 03:03:21,655 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 03:03:21,655 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 03:03:21,656 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 03:03:21,656 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 03:03:21,656 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 03:03:21,657 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 03:03:21,658 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 03:03:21,658 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 03:03:21,658 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 03:03:21,658 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 03:03:21,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 03:03:21,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 03:03:21,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 03:03:21,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 03:03:21,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 03:03:21,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 03:03:21,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 03:03:21,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 03:03:21,661 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 03:03:21,661 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 03:03:21,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 03:03:21,663 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 03:03:21,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 03:03:21,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 03:03:21,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 03:03:21,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 03:03:21,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:03:21,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 03:03:21,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 03:03:21,665 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 03:03:21,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 03:03:21,666 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 03:03:21,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 03:03:21,666 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_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/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_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs 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 valid-memcleanup) ) 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 -> a71ed7b24cb625c47cfb1b6ba9f6cdbf2879f063 [2021-10-16 03:03:21,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 03:03:21,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 03:03:21,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 03:03:21,966 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 03:03:21,970 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 03:03:21,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-16 03:03:22,038 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/data/6b778d3a2/19697e11a2854566a665b004132d2f48/FLAGe1bf1c22e [2021-10-16 03:03:22,563 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 03:03:22,566 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-16 03:03:22,585 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/data/6b778d3a2/19697e11a2854566a665b004132d2f48/FLAGe1bf1c22e [2021-10-16 03:03:22,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/data/6b778d3a2/19697e11a2854566a665b004132d2f48 [2021-10-16 03:03:22,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 03:03:22,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 03:03:22,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 03:03:22,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 03:03:22,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 03:03:22,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:03:22" (1/1) ... [2021-10-16 03:03:22,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c83bee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:22, skipping insertion in model container [2021-10-16 03:03:22,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:03:22" (1/1) ... [2021-10-16 03:03:22,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 03:03:22,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 03:03:23,258 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_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-16 03:03:23,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:03:23,322 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 03:03:23,370 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_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-16 03:03:23,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:03:23,434 INFO L208 MainTranslator]: Completed translation [2021-10-16 03:03:23,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23 WrapperNode [2021-10-16 03:03:23,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 03:03:23,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 03:03:23,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 03:03:23,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 03:03:23,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 03:03:23,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 03:03:23,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 03:03:23,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 03:03:23,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 03:03:23,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 03:03:23,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 03:03:23,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 03:03:23,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (1/1) ... [2021-10-16 03:03:23,621 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:03:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:03:23,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 03:03:23,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 03:03:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 03:03:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 03:03:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 03:03:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 03:03:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 03:03:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-16 03:03:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 03:03:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 03:03:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 03:03:25,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 03:03:25,103 INFO L299 CfgBuilder]: Removed 137 assume(true) statements. [2021-10-16 03:03:25,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:03:25 BoogieIcfgContainer [2021-10-16 03:03:25,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 03:03:25,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 03:03:25,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 03:03:25,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 03:03:25,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:03:22" (1/3) ... [2021-10-16 03:03:25,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221af8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:03:25, skipping insertion in model container [2021-10-16 03:03:25,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:03:23" (2/3) ... [2021-10-16 03:03:25,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221af8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:03:25, skipping insertion in model container [2021-10-16 03:03:25,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:03:25" (3/3) ... [2021-10-16 03:03:25,116 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-10-16 03:03:25,122 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 03:03:25,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2021-10-16 03:03:25,168 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 03:03:25,174 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 03:03:25,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2021-10-16 03:03:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 03:03:25,206 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:25,207 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 03:03:25,207 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash 883824, now seen corresponding path program 1 times [2021-10-16 03:03:25,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:25,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325362468] [2021-10-16 03:03:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:25,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:25,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:25,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325362468] [2021-10-16 03:03:25,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325362468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:25,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:25,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:03:25,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290884298] [2021-10-16 03:03:25,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:03:25,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:03:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:03:25,489 INFO L87 Difference]: Start difference. First operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:25,758 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2021-10-16 03:03:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:03:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-16 03:03:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:25,771 INFO L225 Difference]: With dead ends: 278 [2021-10-16 03:03:25,771 INFO L226 Difference]: Without dead ends: 277 [2021-10-16 03:03:25,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:03:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-16 03:03:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-10-16 03:03:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 144 states have (on average 2.0) internal successors, (288), 275 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 288 transitions. [2021-10-16 03:03:25,822 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 288 transitions. Word has length 3 [2021-10-16 03:03:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:25,823 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 288 transitions. [2021-10-16 03:03:25,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 288 transitions. [2021-10-16 03:03:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 03:03:25,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:25,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 03:03:25,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 03:03:25,825 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 883825, now seen corresponding path program 1 times [2021-10-16 03:03:25,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:25,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311717944] [2021-10-16 03:03:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:25,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:25,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:25,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311717944] [2021-10-16 03:03:25,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311717944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:25,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:25,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:03:25,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247052030] [2021-10-16 03:03:25,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:03:25,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:03:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:03:25,902 INFO L87 Difference]: Start difference. First operand 276 states and 288 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:26,142 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2021-10-16 03:03:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:03:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-16 03:03:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:26,145 INFO L225 Difference]: With dead ends: 271 [2021-10-16 03:03:26,145 INFO L226 Difference]: Without dead ends: 271 [2021-10-16 03:03:26,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 03:03:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-16 03:03:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2021-10-16 03:03:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.9583333333333333) internal successors, (282), 269 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2021-10-16 03:03:26,161 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 3 [2021-10-16 03:03:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:26,161 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2021-10-16 03:03:26,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2021-10-16 03:03:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 03:03:26,162 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:26,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 03:03:26,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 03:03:26,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash 849381547, now seen corresponding path program 1 times [2021-10-16 03:03:26,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:26,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606862182] [2021-10-16 03:03:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:26,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:26,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:26,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606862182] [2021-10-16 03:03:26,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606862182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:26,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:26,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:26,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446313644] [2021-10-16 03:03:26,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 03:03:26,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 03:03:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:26,257 INFO L87 Difference]: Start difference. First operand 270 states and 282 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:26,540 INFO L93 Difference]: Finished difference Result 262 states and 274 transitions. [2021-10-16 03:03:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-16 03:03:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:26,542 INFO L225 Difference]: With dead ends: 262 [2021-10-16 03:03:26,543 INFO L226 Difference]: Without dead ends: 262 [2021-10-16 03:03:26,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 03:03:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-16 03:03:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-10-16 03:03:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.8958333333333333) internal successors, (273), 260 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2021-10-16 03:03:26,555 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 5 [2021-10-16 03:03:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:26,555 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 273 transitions. [2021-10-16 03:03:26,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 273 transitions. [2021-10-16 03:03:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 03:03:26,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:26,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 03:03:26,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 03:03:26,557 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 849381548, now seen corresponding path program 1 times [2021-10-16 03:03:26,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:26,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950708846] [2021-10-16 03:03:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:26,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:26,631 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:26,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950708846] [2021-10-16 03:03:26,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950708846] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:26,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:26,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:03:26,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72370646] [2021-10-16 03:03:26,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:26,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:26,633 INFO L87 Difference]: Start difference. First operand 261 states and 273 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:26,916 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2021-10-16 03:03:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 03:03:26,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-16 03:03:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:26,918 INFO L225 Difference]: With dead ends: 253 [2021-10-16 03:03:26,919 INFO L226 Difference]: Without dead ends: 253 [2021-10-16 03:03:26,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-16 03:03:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-10-16 03:03:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-16 03:03:26,938 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 5 [2021-10-16 03:03:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:26,938 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-16 03:03:26,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-16 03:03:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 03:03:26,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:26,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 03:03:26,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 03:03:26,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 561024176, now seen corresponding path program 1 times [2021-10-16 03:03:26,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:26,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873489241] [2021-10-16 03:03:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:26,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:26,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:26,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873489241] [2021-10-16 03:03:26,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873489241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:26,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:26,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:26,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28131221] [2021-10-16 03:03:26,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:26,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:26,988 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:27,184 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-10-16 03:03:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 03:03:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:27,186 INFO L225 Difference]: With dead ends: 250 [2021-10-16 03:03:27,186 INFO L226 Difference]: Without dead ends: 250 [2021-10-16 03:03:27,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-16 03:03:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-10-16 03:03:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 144 states have (on average 1.8125) internal successors, (261), 248 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 261 transitions. [2021-10-16 03:03:27,193 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 261 transitions. Word has length 6 [2021-10-16 03:03:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:27,194 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 261 transitions. [2021-10-16 03:03:27,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 261 transitions. [2021-10-16 03:03:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 03:03:27,195 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:27,195 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 03:03:27,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 03:03:27,195 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 561024177, now seen corresponding path program 1 times [2021-10-16 03:03:27,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:27,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467653193] [2021-10-16 03:03:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:27,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:27,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:27,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467653193] [2021-10-16 03:03:27,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467653193] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:27,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:27,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:27,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36910860] [2021-10-16 03:03:27,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:27,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:27,285 INFO L87 Difference]: Start difference. First operand 249 states and 261 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:27,448 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2021-10-16 03:03:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 03:03:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:27,450 INFO L225 Difference]: With dead ends: 247 [2021-10-16 03:03:27,451 INFO L226 Difference]: Without dead ends: 247 [2021-10-16 03:03:27,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-16 03:03:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-10-16 03:03:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 144 states have (on average 1.7916666666666667) internal successors, (258), 245 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 258 transitions. [2021-10-16 03:03:27,457 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 258 transitions. Word has length 6 [2021-10-16 03:03:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:27,457 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 258 transitions. [2021-10-16 03:03:27,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 258 transitions. [2021-10-16 03:03:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 03:03:27,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:27,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:27,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 03:03:27,459 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:27,459 INFO L82 PathProgramCache]: Analyzing trace with hash -654503221, now seen corresponding path program 1 times [2021-10-16 03:03:27,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:27,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751079608] [2021-10-16 03:03:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:27,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:27,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:27,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751079608] [2021-10-16 03:03:27,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751079608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:27,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:27,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:03:27,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361133522] [2021-10-16 03:03:27,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:27,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:27,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:27,615 INFO L87 Difference]: Start difference. First operand 246 states and 258 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:27,875 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2021-10-16 03:03:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-16 03:03:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:27,877 INFO L225 Difference]: With dead ends: 245 [2021-10-16 03:03:27,877 INFO L226 Difference]: Without dead ends: 245 [2021-10-16 03:03:27,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-16 03:03:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-16 03:03:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7847222222222223) internal successors, (257), 244 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 257 transitions. [2021-10-16 03:03:27,884 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 257 transitions. Word has length 10 [2021-10-16 03:03:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:27,884 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 257 transitions. [2021-10-16 03:03:27,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 257 transitions. [2021-10-16 03:03:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 03:03:27,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:27,885 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:27,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 03:03:27,885 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash -654503222, now seen corresponding path program 1 times [2021-10-16 03:03:27,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:27,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496083156] [2021-10-16 03:03:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:27,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:28,037 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:28,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496083156] [2021-10-16 03:03:28,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496083156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:28,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:28,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 03:03:28,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552921456] [2021-10-16 03:03:28,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 03:03:28,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 03:03:28,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 03:03:28,040 INFO L87 Difference]: Start difference. First operand 245 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:28,221 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-10-16 03:03:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:03:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-16 03:03:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:28,227 INFO L225 Difference]: With dead ends: 244 [2021-10-16 03:03:28,228 INFO L226 Difference]: Without dead ends: 244 [2021-10-16 03:03:28,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 03:03:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-16 03:03:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-16 03:03:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.7777777777777777) internal successors, (256), 243 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-10-16 03:03:28,235 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 10 [2021-10-16 03:03:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:28,236 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-10-16 03:03:28,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-10-16 03:03:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 03:03:28,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:28,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:28,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 03:03:28,238 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1226462896, now seen corresponding path program 1 times [2021-10-16 03:03:28,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:28,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641843248] [2021-10-16 03:03:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:28,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:28,431 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:28,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641843248] [2021-10-16 03:03:28,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641843248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:28,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:28,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 03:03:28,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461397373] [2021-10-16 03:03:28,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 03:03:28,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 03:03:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:03:28,442 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:28,667 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-10-16 03:03:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:03:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-16 03:03:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:28,668 INFO L225 Difference]: With dead ends: 243 [2021-10-16 03:03:28,668 INFO L226 Difference]: Without dead ends: 243 [2021-10-16 03:03:28,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:03:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-10-16 03:03:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-10-16 03:03:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 242 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2021-10-16 03:03:28,674 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 14 [2021-10-16 03:03:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:28,675 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2021-10-16 03:03:28,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2021-10-16 03:03:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 03:03:28,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:28,675 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:28,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 03:03:28,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1226462897, now seen corresponding path program 1 times [2021-10-16 03:03:28,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:28,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109146970] [2021-10-16 03:03:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:28,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:28,819 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:28,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109146970] [2021-10-16 03:03:28,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109146970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:28,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:28,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 03:03:28,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594176847] [2021-10-16 03:03:28,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:28,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:28,821 INFO L87 Difference]: Start difference. First operand 243 states and 255 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:29,094 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-10-16 03:03:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-16 03:03:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:29,097 INFO L225 Difference]: With dead ends: 242 [2021-10-16 03:03:29,097 INFO L226 Difference]: Without dead ends: 242 [2021-10-16 03:03:29,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-16 03:03:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-16 03:03:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 241 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-10-16 03:03:29,104 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 14 [2021-10-16 03:03:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:29,104 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-10-16 03:03:29,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-10-16 03:03:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 03:03:29,105 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:29,105 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:29,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 03:03:29,106 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 640226691, now seen corresponding path program 1 times [2021-10-16 03:03:29,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:29,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731172509] [2021-10-16 03:03:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:29,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:29,211 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:29,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731172509] [2021-10-16 03:03:29,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731172509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:29,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:29,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:29,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758568786] [2021-10-16 03:03:29,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 03:03:29,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 03:03:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:29,214 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:29,444 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2021-10-16 03:03:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-16 03:03:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:29,446 INFO L225 Difference]: With dead ends: 245 [2021-10-16 03:03:29,446 INFO L226 Difference]: Without dead ends: 245 [2021-10-16 03:03:29,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 03:03:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-16 03:03:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-10-16 03:03:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 234 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 247 transitions. [2021-10-16 03:03:29,452 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 247 transitions. Word has length 24 [2021-10-16 03:03:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:29,453 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 247 transitions. [2021-10-16 03:03:29,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 247 transitions. [2021-10-16 03:03:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 03:03:29,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:29,454 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:29,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 03:03:29,454 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash 640226692, now seen corresponding path program 1 times [2021-10-16 03:03:29,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:29,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204749534] [2021-10-16 03:03:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:29,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:29,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:29,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204749534] [2021-10-16 03:03:29,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204749534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:29,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:29,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:29,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633557877] [2021-10-16 03:03:29,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 03:03:29,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 03:03:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:29,542 INFO L87 Difference]: Start difference. First operand 235 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:29,760 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2021-10-16 03:03:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-16 03:03:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:29,762 INFO L225 Difference]: With dead ends: 238 [2021-10-16 03:03:29,762 INFO L226 Difference]: Without dead ends: 238 [2021-10-16 03:03:29,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:03:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-16 03:03:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2021-10-16 03:03:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 144 states have (on average 1.6666666666666667) internal successors, (240), 227 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2021-10-16 03:03:29,768 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 24 [2021-10-16 03:03:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:29,768 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2021-10-16 03:03:29,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2021-10-16 03:03:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-16 03:03:29,769 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:29,769 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:29,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 03:03:29,770 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1627808933, now seen corresponding path program 1 times [2021-10-16 03:03:29,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:29,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790740573] [2021-10-16 03:03:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:29,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:29,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:29,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790740573] [2021-10-16 03:03:29,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790740573] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:29,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:29,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:29,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427616186] [2021-10-16 03:03:29,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 03:03:29,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 03:03:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:29,917 INFO L87 Difference]: Start difference. First operand 228 states and 240 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:30,138 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2021-10-16 03:03:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-16 03:03:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:30,140 INFO L225 Difference]: With dead ends: 231 [2021-10-16 03:03:30,141 INFO L226 Difference]: Without dead ends: 231 [2021-10-16 03:03:30,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 03:03:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-16 03:03:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2021-10-16 03:03:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 144 states have (on average 1.6180555555555556) internal successors, (233), 220 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2021-10-16 03:03:30,147 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 25 [2021-10-16 03:03:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:30,148 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2021-10-16 03:03:30,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2021-10-16 03:03:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-16 03:03:30,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:30,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:30,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 03:03:30,149 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1627808932, now seen corresponding path program 1 times [2021-10-16 03:03:30,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:30,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675854944] [2021-10-16 03:03:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:30,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:30,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:30,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675854944] [2021-10-16 03:03:30,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675854944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:30,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:30,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 03:03:30,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444694595] [2021-10-16 03:03:30,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 03:03:30,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 03:03:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:30,238 INFO L87 Difference]: Start difference. First operand 221 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:30,428 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2021-10-16 03:03:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:30,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-16 03:03:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:30,431 INFO L225 Difference]: With dead ends: 224 [2021-10-16 03:03:30,431 INFO L226 Difference]: Without dead ends: 224 [2021-10-16 03:03:30,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:03:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-16 03:03:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2021-10-16 03:03:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.5694444444444444) internal successors, (226), 213 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2021-10-16 03:03:30,438 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 25 [2021-10-16 03:03:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:30,438 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2021-10-16 03:03:30,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2021-10-16 03:03:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-16 03:03:30,441 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:30,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:30,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-16 03:03:30,442 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -955589745, now seen corresponding path program 1 times [2021-10-16 03:03:30,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:30,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784960683] [2021-10-16 03:03:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:30,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:31,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:31,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784960683] [2021-10-16 03:03:31,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784960683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:31,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:31,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-16 03:03:31,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104981125] [2021-10-16 03:03:31,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-16 03:03:31,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:31,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-16 03:03:31,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-16 03:03:31,105 INFO L87 Difference]: Start difference. First operand 214 states and 226 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:32,910 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2021-10-16 03:03:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-16 03:03:32,911 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-16 03:03:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:32,914 INFO L225 Difference]: With dead ends: 406 [2021-10-16 03:03:32,914 INFO L226 Difference]: Without dead ends: 406 [2021-10-16 03:03:32,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1232.2ms TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-10-16 03:03:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-10-16 03:03:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 226. [2021-10-16 03:03:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 225 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 239 transitions. [2021-10-16 03:03:32,926 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 239 transitions. Word has length 27 [2021-10-16 03:03:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:32,927 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 239 transitions. [2021-10-16 03:03:32,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 239 transitions. [2021-10-16 03:03:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-16 03:03:32,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:32,935 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:32,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-16 03:03:32,935 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash 801448723, now seen corresponding path program 1 times [2021-10-16 03:03:32,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:32,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682579862] [2021-10-16 03:03:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:32,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:33,433 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:33,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682579862] [2021-10-16 03:03:33,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682579862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:33,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:33,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-16 03:03:33,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249736911] [2021-10-16 03:03:33,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-16 03:03:33,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-16 03:03:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-16 03:03:33,435 INFO L87 Difference]: Start difference. First operand 226 states and 239 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:35,167 INFO L93 Difference]: Finished difference Result 488 states and 518 transitions. [2021-10-16 03:03:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-16 03:03:35,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-16 03:03:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:35,171 INFO L225 Difference]: With dead ends: 488 [2021-10-16 03:03:35,171 INFO L226 Difference]: Without dead ends: 488 [2021-10-16 03:03:35,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 909.2ms TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2021-10-16 03:03:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-10-16 03:03:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 268. [2021-10-16 03:03:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 267 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2021-10-16 03:03:35,183 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 29 [2021-10-16 03:03:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:35,183 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2021-10-16 03:03:35,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2021-10-16 03:03:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-16 03:03:35,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:35,187 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:35,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-16 03:03:35,188 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -924887149, now seen corresponding path program 1 times [2021-10-16 03:03:35,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:35,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298238659] [2021-10-16 03:03:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:35,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:35,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:35,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298238659] [2021-10-16 03:03:35,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298238659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:35,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:35,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-16 03:03:35,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169073036] [2021-10-16 03:03:35,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-16 03:03:35,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-16 03:03:35,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-16 03:03:35,915 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:37,605 INFO L93 Difference]: Finished difference Result 416 states and 455 transitions. [2021-10-16 03:03:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-16 03:03:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-16 03:03:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:37,609 INFO L225 Difference]: With dead ends: 416 [2021-10-16 03:03:37,609 INFO L226 Difference]: Without dead ends: 416 [2021-10-16 03:03:37,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1012.7ms TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-10-16 03:03:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-16 03:03:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 267. [2021-10-16 03:03:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 198 states have (on average 1.5) internal successors, (297), 266 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2021-10-16 03:03:37,617 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 30 [2021-10-16 03:03:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:37,618 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2021-10-16 03:03:37,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2021-10-16 03:03:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-16 03:03:37,619 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:37,619 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:37,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 03:03:37,619 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -924887148, now seen corresponding path program 1 times [2021-10-16 03:03:37,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:37,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434231494] [2021-10-16 03:03:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:37,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:38,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 03:03:38,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434231494] [2021-10-16 03:03:38,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434231494] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:38,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:38,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-16 03:03:38,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442552612] [2021-10-16 03:03:38,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-16 03:03:38,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 03:03:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-16 03:03:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-10-16 03:03:38,273 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:40,417 INFO L93 Difference]: Finished difference Result 445 states and 484 transitions. [2021-10-16 03:03:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-16 03:03:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-16 03:03:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:40,420 INFO L225 Difference]: With dead ends: 445 [2021-10-16 03:03:40,420 INFO L226 Difference]: Without dead ends: 445 [2021-10-16 03:03:40,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1337.7ms TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2021-10-16 03:03:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-10-16 03:03:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 271. [2021-10-16 03:03:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.49009900990099) internal successors, (301), 270 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2021-10-16 03:03:40,429 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 30 [2021-10-16 03:03:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:40,429 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2021-10-16 03:03:40,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:03:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2021-10-16 03:03:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-16 03:03:40,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:40,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:40,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-16 03:03:40,431 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-16 03:03:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1077683325, now seen corresponding path program 1 times [2021-10-16 03:03:40,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 03:03:40,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647545918] [2021-10-16 03:03:40,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:40,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 03:03:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:03:40,480 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 03:03:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:03:40,572 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-16 03:03:40,573 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 03:03:40,574 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 03:03:40,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 03:03:40,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 03:03:40,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 03:03:40,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 03:03:40,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 03:03:40,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 03:03:40,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 03:03:40,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-16 03:03:40,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 03:03:40,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-16 03:03:40,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-16 03:03:40,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 03:03:40,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 03:03:40,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-16 03:03:40,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 03:03:40,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 03:03:40,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-16 03:03:40,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 03:03:40,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-16 03:03:40,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-16 03:03:40,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 03:03:40,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 03:03:40,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-16 03:03:40,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-16 03:03:40,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 03:03:40,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-16 03:03:40,583 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 03:03:40,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 03:03:40,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 03:03:40,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-16 03:03:40,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-16 03:03:40,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-16 03:03:40,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-16 03:03:40,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-16 03:03:40,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-16 03:03:40,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-16 03:03:40,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-16 03:03:40,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-16 03:03:40,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-16 03:03:40,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-16 03:03:40,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-16 03:03:40,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-16 03:03:40,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-16 03:03:40,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-16 03:03:40,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-16 03:03:40,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-16 03:03:40,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-16 03:03:40,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-16 03:03:40,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-16 03:03:40,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-16 03:03:40,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-16 03:03:40,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-16 03:03:40,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-16 03:03:40,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-16 03:03:40,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-16 03:03:40,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-16 03:03:40,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-16 03:03:40,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-16 03:03:40,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-16 03:03:40,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-16 03:03:40,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-16 03:03:40,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-16 03:03:40,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-16 03:03:40,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-16 03:03:40,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-16 03:03:40,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-16 03:03:40,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-16 03:03:40,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-16 03:03:40,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-16 03:03:40,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-16 03:03:40,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-16 03:03:40,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-16 03:03:40,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:03:40,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:03:40,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:03:40,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:03:40,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 03:03:40,610 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 03:03:40,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 03:03:40 BoogieIcfgContainer [2021-10-16 03:03:40,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 03:03:40,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 03:03:40,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 03:03:40,655 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 03:03:40,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:03:25" (3/4) ... [2021-10-16 03:03:40,657 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 03:03:40,702 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 03:03:40,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 03:03:40,704 INFO L168 Benchmark]: Toolchain (without parser) took 17857.94 ms. Allocated memory was 94.4 MB in the beginning and 220.2 MB in the end (delta: 125.8 MB). Free memory was 69.2 MB in the beginning and 170.4 MB in the end (delta: -101.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,705 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 75.5 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:03:40,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.53 ms. Allocated memory is still 94.4 MB. Free memory was 69.0 MB in the beginning and 61.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.55 ms. Allocated memory is still 94.4 MB. Free memory was 61.6 MB in the beginning and 58.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,706 INFO L168 Benchmark]: Boogie Preprocessor took 82.91 ms. Allocated memory is still 94.4 MB. Free memory was 58.3 MB in the beginning and 55.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,707 INFO L168 Benchmark]: RCFGBuilder took 1496.23 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 55.0 MB in the beginning and 82.1 MB in the end (delta: -27.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,707 INFO L168 Benchmark]: TraceAbstraction took 15545.31 ms. Allocated memory was 125.8 MB in the beginning and 220.2 MB in the end (delta: 94.4 MB). Free memory was 82.1 MB in the beginning and 175.6 MB in the end (delta: -93.5 MB). Peak memory consumption was 116.7 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,707 INFO L168 Benchmark]: Witness Printer took 48.19 ms. Allocated memory is still 220.2 MB. Free memory was 174.6 MB in the beginning and 170.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 03:03:40,709 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.34 ms. Allocated memory is still 75.5 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 587.53 ms. Allocated memory is still 94.4 MB. Free memory was 69.0 MB in the beginning and 61.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.55 ms. Allocated memory is still 94.4 MB. Free memory was 61.6 MB in the beginning and 58.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.91 ms. Allocated memory is still 94.4 MB. Free memory was 58.3 MB in the beginning and 55.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1496.23 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 55.0 MB in the beginning and 82.1 MB in the end (delta: -27.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15545.31 ms. Allocated memory was 125.8 MB in the beginning and 220.2 MB in the end (delta: 94.4 MB). Free memory was 82.1 MB in the beginning and 175.6 MB in the end (delta: -93.5 MB). Peak memory consumption was 116.7 MB. Max. memory is 16.1 GB. * Witness Printer took 48.19 ms. Allocated memory is still 220.2 MB. Free memory was 174.6 MB in the beginning and 170.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L588] struct node *list = ((void *)0); [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] struct node *list = create_sll(&p1, &p2); [L642] \read(*p1) [L642] \read(*p2) [L626] COND FALSE !(!(beg)) [L627] COND FALSE !(!(end)) [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg [L629] COND TRUE !(beg) [L565] reach_error() - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 15440.0ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 34.6ms, AutomataDifference: 10715.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3046 SDtfs, 5744 SDslu, 9413 SDs, 0 SdLazy, 7941 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5548.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 4794.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 175.7ms AutomataMinimizationTime, 18 MinimizatonAttempts, 769 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 89.2ms SsaConstructionTime, 579.1ms SatisfiabilityAnalysisTime, 3395.5ms InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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-10-16 03:03:40,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd6a8bfd-8b90-45b3-913e-cbffb02476e3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...