./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI --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 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:20:47,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:20:47,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:20:47,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:20:47,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:20:47,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:20:47,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:20:47,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:20:47,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:20:47,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:20:47,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:20:47,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:20:47,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:20:47,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:20:47,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:20:47,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:20:47,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:20:47,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:20:47,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:20:47,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:20:47,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:20:47,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:20:47,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:20:47,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:20:47,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:20:47,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:20:47,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:20:47,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:20:47,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:20:47,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:20:47,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:20:47,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:20:47,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:20:47,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:20:47,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:20:47,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:20:47,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:20:47,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:20:47,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:20:47,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:20:47,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:20:47,503 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-03 02:20:47,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:20:47,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:20:47,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:20:47,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:20:47,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:20:47,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:20:47,541 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:20:47,541 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:20:47,541 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:20:47,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:20:47,543 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:20:47,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:20:47,544 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:20:47,544 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:20:47,544 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:20:47,545 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:20:47,545 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:20:47,545 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:20:47,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:20:47,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:20:47,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:20:47,547 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:20:47,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:20:47,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:20:47,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:20:47,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:20:47,550 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:20:47,550 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:20:47,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:20:47,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:20:47,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:20:47,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:20:47,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:20:47,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:20:47,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:20:47,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:20:47,553 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:20:47,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:20:47,553 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:20:47,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:20:47,554 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:20:47,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI 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 -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2022-11-03 02:20:47,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:20:47,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:20:47,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:20:47,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:20:47,915 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:20:47,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-11-03 02:20:48,005 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/data/512b53ed0/70949aa4ac554264a854875457afe1a8/FLAG4029e90a5 [2022-11-03 02:20:48,734 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:20:48,735 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-11-03 02:20:48,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/data/512b53ed0/70949aa4ac554264a854875457afe1a8/FLAG4029e90a5 [2022-11-03 02:20:48,997 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/data/512b53ed0/70949aa4ac554264a854875457afe1a8 [2022-11-03 02:20:49,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:20:49,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:20:49,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:20:49,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:20:49,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:20:49,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208dd754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49, skipping insertion in model container [2022-11-03 02:20:49,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:20:49,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:20:49,506 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-11-03 02:20:49,511 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-11-03 02:20:49,514 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-11-03 02:20:49,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:20:49,530 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:20:49,571 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-11-03 02:20:49,573 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-11-03 02:20:49,575 WARN L230 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_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-11-03 02:20:49,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:20:49,607 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:20:49,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49 WrapperNode [2022-11-03 02:20:49,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:20:49,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:20:49,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:20:49,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:20:49,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,703 INFO L138 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-11-03 02:20:49,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:20:49,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:20:49,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:20:49,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:20:49,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:20:49,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:20:49,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:20:49,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:20:49,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (1/1) ... [2022-11-03 02:20:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:20:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:49,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:20:49,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:20:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:20:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:20:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:20:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:20:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:20:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:20:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:20:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:20:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:20:49,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:20:50,052 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:20:50,055 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:20:50,569 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:20:50,628 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:20:50,628 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 02:20:50,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:50 BoogieIcfgContainer [2022-11-03 02:20:50,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:20:50,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:20:50,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:20:50,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:20:50,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:20:49" (1/3) ... [2022-11-03 02:20:50,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4f0a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:20:50, skipping insertion in model container [2022-11-03 02:20:50,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:49" (2/3) ... [2022-11-03 02:20:50,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4f0a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:20:50, skipping insertion in model container [2022-11-03 02:20:50,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:50" (3/3) ... [2022-11-03 02:20:50,654 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2022-11-03 02:20:50,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:20:50,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-03 02:20:50,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:20:50,760 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66552a79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:20:50,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-03 02:20:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 45 states have (on average 2.533333333333333) internal successors, (114), 95 states have internal predecessors, (114), 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) [2022-11-03 02:20:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:20:50,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:50,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:20:50,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash 7382, now seen corresponding path program 1 times [2022-11-03 02:20:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432713230] [2022-11-03 02:20:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:51,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432713230] [2022-11-03 02:20:51,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432713230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:51,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:51,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:20:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860589148] [2022-11-03 02:20:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:51,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:51,174 INFO L87 Difference]: Start difference. First operand has 96 states, 45 states have (on average 2.533333333333333) internal successors, (114), 95 states have internal predecessors, (114), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-03 02:20:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:51,409 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-03 02:20:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-03 02:20:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:51,424 INFO L225 Difference]: With dead ends: 102 [2022-11-03 02:20:51,424 INFO L226 Difference]: Without dead ends: 101 [2022-11-03 02:20:51,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:51,432 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:51,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 63 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-03 02:20:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-11-03 02:20:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 90 states have internal predecessors, (97), 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) [2022-11-03 02:20:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-03 02:20:51,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 2 [2022-11-03 02:20:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:51,500 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-03 02:20:51,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-03 02:20:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-03 02:20:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:20:51,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:51,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:20:51,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:20:51,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:51,506 INFO L85 PathProgramCache]: Analyzing trace with hash 7383, now seen corresponding path program 1 times [2022-11-03 02:20:51,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:51,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253511798] [2022-11-03 02:20:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:51,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253511798] [2022-11-03 02:20:51,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253511798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:51,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:20:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040021638] [2022-11-03 02:20:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:51,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:51,696 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-03 02:20:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:51,820 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-11-03 02:20:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-03 02:20:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:51,822 INFO L225 Difference]: With dead ends: 99 [2022-11-03 02:20:51,823 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 02:20:51,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:51,825 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:51,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 66 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 02:20:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-11-03 02:20:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 2.066666666666667) internal successors, (93), 86 states have internal predecessors, (93), 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) [2022-11-03 02:20:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-03 02:20:51,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 2 [2022-11-03 02:20:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:51,835 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-03 02:20:51,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-03 02:20:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-03 02:20:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:20:51,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:51,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:20:51,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:20:51,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1767036755, now seen corresponding path program 1 times [2022-11-03 02:20:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:51,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974834928] [2022-11-03 02:20:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:51,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:51,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974834928] [2022-11-03 02:20:51,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974834928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:51,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:51,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:20:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963425424] [2022-11-03 02:20:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:51,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:51,951 INFO L87 Difference]: Start difference. First operand 87 states and 93 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) [2022-11-03 02:20:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:52,157 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-03 02:20:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:52,157 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 [2022-11-03 02:20:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:52,163 INFO L225 Difference]: With dead ends: 84 [2022-11-03 02:20:52,163 INFO L226 Difference]: Without dead ends: 84 [2022-11-03 02:20:52,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:52,172 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:52,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 42 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-03 02:20:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-11-03 02:20:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.8) internal successors, (81), 74 states have internal predecessors, (81), 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) [2022-11-03 02:20:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-03 02:20:52,189 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 6 [2022-11-03 02:20:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:52,189 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-03 02:20:52,190 INFO L496 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) [2022-11-03 02:20:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-03 02:20:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:20:52,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:52,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:20:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:20:52,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1767036754, now seen corresponding path program 1 times [2022-11-03 02:20:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:52,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210277603] [2022-11-03 02:20:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:52,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:52,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210277603] [2022-11-03 02:20:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210277603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:52,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:52,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:20:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582228947] [2022-11-03 02:20:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:52,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:52,438 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-03 02:20:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:52,630 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-03 02:20:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:20:52,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2022-11-03 02:20:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:52,632 INFO L225 Difference]: With dead ends: 96 [2022-11-03 02:20:52,632 INFO L226 Difference]: Without dead ends: 96 [2022-11-03 02:20:52,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:52,642 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:52,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-03 02:20:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2022-11-03 02:20:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.75) internal successors, (91), 81 states have internal predecessors, (91), 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) [2022-11-03 02:20:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-11-03 02:20:52,653 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 6 [2022-11-03 02:20:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:52,658 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-11-03 02:20:52,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-03 02:20:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-11-03 02:20:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:20:52,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:52,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:20:52,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1610054351, now seen corresponding path program 1 times [2022-11-03 02:20:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:52,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336370227] [2022-11-03 02:20:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:52,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:52,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336370227] [2022-11-03 02:20:52,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336370227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:52,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:52,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768589973] [2022-11-03 02:20:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:52,881 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-11-03 02:20:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:53,064 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-11-03 02:20:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-03 02:20:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:53,066 INFO L225 Difference]: With dead ends: 81 [2022-11-03 02:20:53,067 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 02:20:53,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:20:53,068 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:53,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 02:20:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-03 02:20:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 80 states have internal predecessors, (89), 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) [2022-11-03 02:20:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-11-03 02:20:53,075 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 8 [2022-11-03 02:20:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:53,075 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-11-03 02:20:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-11-03 02:20:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-11-03 02:20:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:20:53,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:53,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:53,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:20:53,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1610054350, now seen corresponding path program 1 times [2022-11-03 02:20:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:53,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913827295] [2022-11-03 02:20:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:53,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:53,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913827295] [2022-11-03 02:20:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913827295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:53,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:53,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844297265] [2022-11-03 02:20:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:53,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:53,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:53,334 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-11-03 02:20:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:53,527 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-11-03 02:20:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-03 02:20:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:53,528 INFO L225 Difference]: With dead ends: 80 [2022-11-03 02:20:53,529 INFO L226 Difference]: Without dead ends: 80 [2022-11-03 02:20:53,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:20:53,531 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:53,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 177 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-03 02:20:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-03 02:20:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 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) [2022-11-03 02:20:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-03 02:20:53,543 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 8 [2022-11-03 02:20:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:53,544 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-03 02:20:53,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-11-03 02:20:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-03 02:20:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:20:53,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:53,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:53,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:20:53,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1622353831, now seen corresponding path program 1 times [2022-11-03 02:20:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:53,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519225559] [2022-11-03 02:20:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:53,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:53,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519225559] [2022-11-03 02:20:53,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519225559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:53,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:53,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:20:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350146484] [2022-11-03 02:20:53,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:53,924 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-11-03 02:20:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:54,241 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-11-03 02:20:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-11-03 02:20:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:54,243 INFO L225 Difference]: With dead ends: 155 [2022-11-03 02:20:54,243 INFO L226 Difference]: Without dead ends: 155 [2022-11-03 02:20:54,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:20:54,244 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 308 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:54,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 184 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-03 02:20:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 82. [2022-11-03 02:20:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 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) [2022-11-03 02:20:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-11-03 02:20:54,250 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 9 [2022-11-03 02:20:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:54,250 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-11-03 02:20:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-11-03 02:20:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-11-03 02:20:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:54,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:54,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:54,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:20:54,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1246634621, now seen corresponding path program 1 times [2022-11-03 02:20:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:54,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385602189] [2022-11-03 02:20:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:54,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385602189] [2022-11-03 02:20:54,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385602189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:54,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:54,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848973161] [2022-11-03 02:20:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:54,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:54,477 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-03 02:20:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:54,759 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-11-03 02:20:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 [2022-11-03 02:20:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:54,761 INFO L225 Difference]: With dead ends: 117 [2022-11-03 02:20:54,762 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 02:20:54,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:54,763 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 184 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:54,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 113 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 02:20:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2022-11-03 02:20:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 96 states have internal predecessors, (119), 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) [2022-11-03 02:20:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-11-03 02:20:54,774 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 10 [2022-11-03 02:20:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:54,774 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-11-03 02:20:54,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-03 02:20:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-11-03 02:20:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:54,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:54,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:54,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:20:54,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1246634620, now seen corresponding path program 1 times [2022-11-03 02:20:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:54,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639210427] [2022-11-03 02:20:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:55,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:55,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639210427] [2022-11-03 02:20:55,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639210427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:55,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:55,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672839970] [2022-11-03 02:20:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:55,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:55,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:55,267 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-03 02:20:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:55,654 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-03 02:20:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:20:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 [2022-11-03 02:20:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:55,655 INFO L225 Difference]: With dead ends: 129 [2022-11-03 02:20:55,655 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 02:20:55,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:20:55,656 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 173 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:55,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 164 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 02:20:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2022-11-03 02:20:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.605263157894737) internal successors, (122), 103 states have internal predecessors, (122), 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) [2022-11-03 02:20:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2022-11-03 02:20:55,661 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 10 [2022-11-03 02:20:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2022-11-03 02:20:55,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2022-11-03 02:20:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2022-11-03 02:20:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:55,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:55,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:55,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:20:55,662 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1073830216, now seen corresponding path program 1 times [2022-11-03 02:20:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:55,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974253025] [2022-11-03 02:20:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:55,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:55,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974253025] [2022-11-03 02:20:55,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974253025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:55,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:55,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:20:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539518796] [2022-11-03 02:20:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:20:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:20:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:55,871 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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) [2022-11-03 02:20:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:56,221 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2022-11-03 02:20:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:20:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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 [2022-11-03 02:20:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:56,222 INFO L225 Difference]: With dead ends: 114 [2022-11-03 02:20:56,222 INFO L226 Difference]: Without dead ends: 114 [2022-11-03 02:20:56,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:20:56,224 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 135 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:56,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 143 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-03 02:20:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2022-11-03 02:20:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 102 states have internal predecessors, (121), 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) [2022-11-03 02:20:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-11-03 02:20:56,228 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 10 [2022-11-03 02:20:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:56,228 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-11-03 02:20:56,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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) [2022-11-03 02:20:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-11-03 02:20:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:56,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:56,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:56,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:20:56,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1073830215, now seen corresponding path program 1 times [2022-11-03 02:20:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:56,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768270086] [2022-11-03 02:20:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:56,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:56,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768270086] [2022-11-03 02:20:56,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768270086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:56,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:56,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:20:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358791947] [2022-11-03 02:20:56,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:56,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:20:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:20:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:20:56,621 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-11-03 02:20:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:57,075 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-11-03 02:20:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:20:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 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 [2022-11-03 02:20:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:57,076 INFO L225 Difference]: With dead ends: 108 [2022-11-03 02:20:57,076 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 02:20:57,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:20:57,077 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 122 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:57,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 139 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 02:20:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2022-11-03 02:20:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 92 states have internal predecessors, (111), 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) [2022-11-03 02:20:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-11-03 02:20:57,081 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 10 [2022-11-03 02:20:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:57,081 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-11-03 02:20:57,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-11-03 02:20:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-11-03 02:20:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:20:57,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:57,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:57,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:20:57,082 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash 90298837, now seen corresponding path program 1 times [2022-11-03 02:20:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:57,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747812246] [2022-11-03 02:20:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:57,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:57,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:57,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747812246] [2022-11-03 02:20:57,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747812246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:57,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:57,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:20:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335967000] [2022-11-03 02:20:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:57,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:20:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:57,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:20:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:57,578 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-11-03 02:20:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:57,934 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-11-03 02:20:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:20:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-11-03 02:20:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:57,936 INFO L225 Difference]: With dead ends: 123 [2022-11-03 02:20:57,936 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 02:20:57,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:20:57,937 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 230 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:57,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 148 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 02:20:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2022-11-03 02:20:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 95 states have internal predecessors, (116), 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) [2022-11-03 02:20:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-03 02:20:57,941 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 13 [2022-11-03 02:20:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:57,941 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-03 02:20:57,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-11-03 02:20:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-03 02:20:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:20:57,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:57,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:20:57,942 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash 90298838, now seen corresponding path program 1 times [2022-11-03 02:20:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:57,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221628829] [2022-11-03 02:20:57,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:58,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:58,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221628829] [2022-11-03 02:20:58,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221628829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:58,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021170974] [2022-11-03 02:20:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:58,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:58,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:58,374 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-03 02:20:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:58,687 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-03 02:20:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-03 02:20:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:58,689 INFO L225 Difference]: With dead ends: 135 [2022-11-03 02:20:58,689 INFO L226 Difference]: Without dead ends: 135 [2022-11-03 02:20:58,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:58,690 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 221 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:58,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-03 02:20:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2022-11-03 02:20:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 95 states have internal predecessors, (115), 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) [2022-11-03 02:20:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2022-11-03 02:20:58,693 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 13 [2022-11-03 02:20:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:58,694 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2022-11-03 02:20:58,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-03 02:20:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-11-03 02:20:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:20:58,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:58,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:58,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:20:58,696 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -939797720, now seen corresponding path program 1 times [2022-11-03 02:20:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:58,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557110324] [2022-11-03 02:20:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:58,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:58,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557110324] [2022-11-03 02:20:58,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557110324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:58,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:58,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530298990] [2022-11-03 02:20:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:20:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:20:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:20:58,821 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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) [2022-11-03 02:20:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:58,945 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-11-03 02:20:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:58,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 [2022-11-03 02:20:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:58,946 INFO L225 Difference]: With dead ends: 94 [2022-11-03 02:20:58,947 INFO L226 Difference]: Without dead ends: 94 [2022-11-03 02:20:58,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:58,948 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 156 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:58,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 70 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-03 02:20:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-03 02:20:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.527027027027027) internal successors, (113), 93 states have internal predecessors, (113), 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) [2022-11-03 02:20:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-11-03 02:20:58,951 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 14 [2022-11-03 02:20:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:58,951 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-11-03 02:20:58,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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) [2022-11-03 02:20:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-11-03 02:20:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:20:58,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:58,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:58,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:20:58,953 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1473390987, now seen corresponding path program 1 times [2022-11-03 02:20:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:58,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612949200] [2022-11-03 02:20:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:59,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612949200] [2022-11-03 02:20:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612949200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:59,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648553818] [2022-11-03 02:20:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:59,194 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-11-03 02:20:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:59,431 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-03 02:20:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-11-03 02:20:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:59,433 INFO L225 Difference]: With dead ends: 135 [2022-11-03 02:20:59,433 INFO L226 Difference]: Without dead ends: 135 [2022-11-03 02:20:59,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:59,434 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 180 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:59,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 147 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-03 02:20:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-11-03 02:20:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 96 states have internal predecessors, (117), 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) [2022-11-03 02:20:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2022-11-03 02:20:59,438 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 16 [2022-11-03 02:20:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:59,438 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2022-11-03 02:20:59,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-11-03 02:20:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-11-03 02:20:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:20:59,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:59,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:59,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:20:59,440 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:20:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1445707782, now seen corresponding path program 1 times [2022-11-03 02:20:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:59,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910854535] [2022-11-03 02:20:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:59,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:59,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910854535] [2022-11-03 02:20:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910854535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:59,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:59,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:20:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718646691] [2022-11-03 02:20:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:59,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:20:59,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:20:59,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:59,922 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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) [2022-11-03 02:21:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:00,502 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-11-03 02:21:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:21:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-11-03 02:21:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:00,504 INFO L225 Difference]: With dead ends: 112 [2022-11-03 02:21:00,504 INFO L226 Difference]: Without dead ends: 112 [2022-11-03 02:21:00,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:21:00,505 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 161 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:00,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 222 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-03 02:21:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2022-11-03 02:21:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 96 states have internal predecessors, (115), 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) [2022-11-03 02:21:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-11-03 02:21:00,509 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 16 [2022-11-03 02:21:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:00,510 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-11-03 02:21:00,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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) [2022-11-03 02:21:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-11-03 02:21:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:21:00,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:00,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:21:00,511 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1569446747, now seen corresponding path program 1 times [2022-11-03 02:21:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:00,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757185593] [2022-11-03 02:21:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:00,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757185593] [2022-11-03 02:21:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757185593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:00,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:21:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356986702] [2022-11-03 02:21:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:00,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:21:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:21:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:00,761 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:21:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:01,036 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-11-03 02:21:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:21:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-11-03 02:21:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:01,038 INFO L225 Difference]: With dead ends: 140 [2022-11-03 02:21:01,038 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 02:21:01,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:21:01,039 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 214 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:01,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 189 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 02:21:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2022-11-03 02:21:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.475) internal successors, (118), 99 states have internal predecessors, (118), 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) [2022-11-03 02:21:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2022-11-03 02:21:01,043 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 17 [2022-11-03 02:21:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:01,043 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2022-11-03 02:21:01,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:21:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2022-11-03 02:21:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:21:01,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:01,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:01,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:21:01,044 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1866896108, now seen corresponding path program 1 times [2022-11-03 02:21:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:01,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822827691] [2022-11-03 02:21:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:01,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:01,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822827691] [2022-11-03 02:21:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822827691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:01,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:01,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:21:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944212326] [2022-11-03 02:21:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:01,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:21:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:21:01,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:01,390 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:21:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:01,740 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-11-03 02:21:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:21:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-11-03 02:21:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:01,742 INFO L225 Difference]: With dead ends: 120 [2022-11-03 02:21:01,742 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 02:21:01,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:21:01,743 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 201 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:01,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 163 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 02:21:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-11-03 02:21:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 103 states have internal predecessors, (123), 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) [2022-11-03 02:21:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2022-11-03 02:21:01,746 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 17 [2022-11-03 02:21:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:01,747 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2022-11-03 02:21:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:21:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-11-03 02:21:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:21:01,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:01,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:21:01,748 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1866896109, now seen corresponding path program 1 times [2022-11-03 02:21:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073709253] [2022-11-03 02:21:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:02,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:02,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073709253] [2022-11-03 02:21:02,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073709253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:02,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:02,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212505611] [2022-11-03 02:21:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:02,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:21:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:21:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:02,109 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-11-03 02:21:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:02,486 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-11-03 02:21:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:21:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-11-03 02:21:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:02,488 INFO L225 Difference]: With dead ends: 131 [2022-11-03 02:21:02,488 INFO L226 Difference]: Without dead ends: 131 [2022-11-03 02:21:02,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:21:02,489 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:02,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 175 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-03 02:21:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2022-11-03 02:21:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 103 states have internal predecessors, (122), 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) [2022-11-03 02:21:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2022-11-03 02:21:02,493 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 17 [2022-11-03 02:21:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:02,493 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2022-11-03 02:21:02,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-11-03 02:21:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2022-11-03 02:21:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:21:02,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:02,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:21:02,495 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1867332820, now seen corresponding path program 1 times [2022-11-03 02:21:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377836890] [2022-11-03 02:21:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:02,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377836890] [2022-11-03 02:21:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377836890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:02,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:21:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011806960] [2022-11-03 02:21:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:02,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:02,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:02,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:02,542 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-11-03 02:21:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:02,594 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2022-11-03 02:21:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:02,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-11-03 02:21:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:02,597 INFO L225 Difference]: With dead ends: 164 [2022-11-03 02:21:02,597 INFO L226 Difference]: Without dead ends: 164 [2022-11-03 02:21:02,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:02,599 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:02,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 107 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:21:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-03 02:21:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 116. [2022-11-03 02:21:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 115 states have internal predecessors, (136), 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) [2022-11-03 02:21:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2022-11-03 02:21:02,608 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 17 [2022-11-03 02:21:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:02,609 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2022-11-03 02:21:02,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-11-03 02:21:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2022-11-03 02:21:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:21:02,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:02,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:21:02,612 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1410461874, now seen corresponding path program 1 times [2022-11-03 02:21:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045654977] [2022-11-03 02:21:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:02,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:02,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045654977] [2022-11-03 02:21:02,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045654977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:02,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:02,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:21:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931565868] [2022-11-03 02:21:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:02,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:21:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:21:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:02,903 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-11-03 02:21:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:03,177 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2022-11-03 02:21:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:21:03,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-11-03 02:21:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:03,179 INFO L225 Difference]: With dead ends: 130 [2022-11-03 02:21:03,179 INFO L226 Difference]: Without dead ends: 126 [2022-11-03 02:21:03,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:21:03,180 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 129 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:03,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 196 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-03 02:21:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-11-03 02:21:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 113 states have internal predecessors, (133), 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) [2022-11-03 02:21:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2022-11-03 02:21:03,184 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 18 [2022-11-03 02:21:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:03,185 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2022-11-03 02:21:03,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-11-03 02:21:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-11-03 02:21:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:21:03,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:03,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:03,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:21:03,187 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -704795978, now seen corresponding path program 1 times [2022-11-03 02:21:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936167315] [2022-11-03 02:21:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:03,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936167315] [2022-11-03 02:21:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936167315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:21:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396598536] [2022-11-03 02:21:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:03,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:03,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:21:03,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:21:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:04,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:21:04,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:04,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-03 02:21:04,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:21:04,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:21:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:04,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:04,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396598536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:04,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:21:04,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-11-03 02:21:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780108530] [2022-11-03 02:21:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:04,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:21:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:21:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:21:04,370 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-11-03 02:21:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:04,691 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-11-03 02:21:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:21:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2022-11-03 02:21:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:04,702 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:21:04,702 INFO L226 Difference]: Without dead ends: 153 [2022-11-03 02:21:04,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:21:04,703 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:04,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-03 02:21:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2022-11-03 02:21:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 105 states have internal predecessors, (126), 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) [2022-11-03 02:21:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-11-03 02:21:04,707 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 19 [2022-11-03 02:21:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:04,707 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-11-03 02:21:04,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-11-03 02:21:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-11-03 02:21:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:21:04,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:04,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:04,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:04,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 02:21:04,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-03 02:21:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1209091334, now seen corresponding path program 1 times [2022-11-03 02:21:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:04,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472432453] [2022-11-03 02:21:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:21:04,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:21:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:21:04,992 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:21:04,992 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:21:04,994 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2022-11-03 02:21:04,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2022-11-03 02:21:04,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2022-11-03 02:21:04,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2022-11-03 02:21:04,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2022-11-03 02:21:04,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2022-11-03 02:21:04,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2022-11-03 02:21:04,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2022-11-03 02:21:04,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2022-11-03 02:21:04,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2022-11-03 02:21:04,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2022-11-03 02:21:04,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2022-11-03 02:21:04,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2022-11-03 02:21:04,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2022-11-03 02:21:05,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2022-11-03 02:21:05,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2022-11-03 02:21:05,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2022-11-03 02:21:05,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (32 of 50 remaining) [2022-11-03 02:21:05,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2022-11-03 02:21:05,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2022-11-03 02:21:05,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2022-11-03 02:21:05,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2022-11-03 02:21:05,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (27 of 50 remaining) [2022-11-03 02:21:05,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2022-11-03 02:21:05,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2022-11-03 02:21:05,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2022-11-03 02:21:05,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2022-11-03 02:21:05,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2022-11-03 02:21:05,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2022-11-03 02:21:05,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2022-11-03 02:21:05,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2022-11-03 02:21:05,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2022-11-03 02:21:05,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2022-11-03 02:21:05,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2022-11-03 02:21:05,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2022-11-03 02:21:05,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2022-11-03 02:21:05,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2022-11-03 02:21:05,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2022-11-03 02:21:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2022-11-03 02:21:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2022-11-03 02:21:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2022-11-03 02:21:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2022-11-03 02:21:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2022-11-03 02:21:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (6 of 50 remaining) [2022-11-03 02:21:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (5 of 50 remaining) [2022-11-03 02:21:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (4 of 50 remaining) [2022-11-03 02:21:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 50 remaining) [2022-11-03 02:21:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 50 remaining) [2022-11-03 02:21:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 50 remaining) [2022-11-03 02:21:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2022-11-03 02:21:05,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:21:05,013 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:05,018 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:21:05,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:21:05 BoogieIcfgContainer [2022-11-03 02:21:05,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:21:05,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:21:05,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:21:05,066 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:21:05,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:50" (3/4) ... [2022-11-03 02:21:05,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:21:05,137 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:21:05,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:21:05,138 INFO L158 Benchmark]: Toolchain (without parser) took 16117.37ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 86.4MB in the beginning and 102.1MB in the end (delta: -15.7MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,139 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:05,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.87ms. Allocated memory is still 121.6MB. Free memory was 86.4MB in the beginning and 90.0MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.25ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,140 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 121.6MB. Free memory was 87.5MB in the beginning and 85.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,141 INFO L158 Benchmark]: RCFGBuilder took 882.83ms. Allocated memory is still 121.6MB. Free memory was 85.8MB in the beginning and 62.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,141 INFO L158 Benchmark]: TraceAbstraction took 14421.73ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 61.9MB in the beginning and 104.2MB in the end (delta: -42.3MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,144 INFO L158 Benchmark]: Witness Printer took 72.54ms. Allocated memory is still 211.8MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:05,154 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.37ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.87ms. Allocated memory is still 121.6MB. Free memory was 86.4MB in the beginning and 90.0MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.25ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 121.6MB. Free memory was 87.5MB in the beginning and 85.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 882.83ms. Allocated memory is still 121.6MB. Free memory was 85.8MB in the beginning and 62.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14421.73ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 61.9MB in the beginning and 104.2MB in the end (delta: -42.3MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 72.54ms. Allocated memory is still 211.8MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: 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, 96 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3039 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3039 mSDsluCounter, 3106 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2205 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3493 IncrementalHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 953 mSDtfsCounter, 3493 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=20, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 498 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 3193 SizeOfPredicates, 8 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 1/2 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! [2022-11-03 02:21:05,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b9642ce-22f4-42a3-a4fd-cae3451f7cdc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)