./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- 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-38b53e6 [2022-11-26 01:00:47,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:00:47,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:00:47,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:00:47,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:00:47,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:00:47,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:00:47,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:00:47,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:00:47,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:00:47,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:00:47,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:00:47,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:00:47,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:00:47,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:00:47,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:00:47,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:00:47,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:00:47,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:00:47,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:00:47,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:00:47,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:00:47,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:00:47,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:00:47,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:00:47,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:00:47,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:00:47,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:00:47,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:00:47,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:00:47,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:00:47,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:00:47,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:00:47,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:00:47,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:00:47,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:00:47,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:00:47,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:00:47,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:00:47,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:00:47,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:00:47,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 01:00:47,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:00:47,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:00:47,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:00:47,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:00:47,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:00:47,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:00:47,560 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:00:47,561 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:00:47,561 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:00:47,561 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:00:47,563 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:00:47,563 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:00:47,563 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:00:47,564 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:00:47,564 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:00:47,564 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:00:47,564 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:00:47,565 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:00:47,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 01:00:47,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 01:00:47,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:00:47,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:00:47,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:00:47,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:00:47,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:00:47,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:00:47,568 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 01:00:47,569 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 01:00:47,569 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 01:00:47,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:00:47,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 01:00:47,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:00:47,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:00:47,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:00:47,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:00:47,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:00:47,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:00:47,572 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:00:47,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:00:47,573 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:00:47,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:00:47,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:00:47,573 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_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/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_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2022-11-26 01:00:47,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:00:48,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:00:48,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:00:48,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:00:48,032 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:00:48,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2022-11-26 01:00:51,891 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:00:52,151 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:00:52,152 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2022-11-26 01:00:52,167 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/data/a83277437/31cb59de11244201a485fad2828eefdb/FLAG3a0260a53 [2022-11-26 01:00:52,189 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/data/a83277437/31cb59de11244201a485fad2828eefdb [2022-11-26 01:00:52,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:00:52,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:00:52,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:00:52,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:00:52,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:00:52,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e64850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52, skipping insertion in model container [2022-11-26 01:00:52,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:00:52,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:00:52,616 WARN L237 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_1bcae006-54fb-4b96-9650-c5884d1716c4/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30422,30435] [2022-11-26 01:00:52,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:00:52,647 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:00:52,714 WARN L237 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_1bcae006-54fb-4b96-9650-c5884d1716c4/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30422,30435] [2022-11-26 01:00:52,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:00:52,778 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:00:52,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52 WrapperNode [2022-11-26 01:00:52,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:00:52,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:00:52,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:00:52,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:00:52,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,826 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2022-11-26 01:00:52,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:00:52,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:00:52,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:00:52,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:00:52,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:00:52,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:00:52,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:00:52,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:00:52,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (1/1) ... [2022-11-26 01:00:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:00:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:00:52,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:00:52,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:00:52,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:00:52,966 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-26 01:00:52,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:00:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:00:52,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:00:52,969 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 01:00:53,179 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:00:53,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:00:53,434 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:00:53,474 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:00:53,475 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:00:53,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:00:53 BoogieIcfgContainer [2022-11-26 01:00:53,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:00:53,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:00:53,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:00:53,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:00:53,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:00:52" (1/3) ... [2022-11-26 01:00:53,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4803a4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:00:53, skipping insertion in model container [2022-11-26 01:00:53,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:52" (2/3) ... [2022-11-26 01:00:53,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4803a4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:00:53, skipping insertion in model container [2022-11-26 01:00:53,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:00:53" (3/3) ... [2022-11-26 01:00:53,491 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2022-11-26 01:00:53,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:00:53,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-26 01:00:53,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 01:00:53,639 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 01:00:53,695 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:00:53,726 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 87 transitions, 179 flow [2022-11-26 01:00:53,732 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 87 transitions, 179 flow [2022-11-26 01:00:53,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 87 transitions, 179 flow [2022-11-26 01:00:53,827 INFO L130 PetriNetUnfolder]: 7/103 cut-off events. [2022-11-26 01:00:53,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-26 01:00:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 103 events. 7/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2022-11-26 01:00:53,839 INFO L119 LiptonReduction]: Number of co-enabled transitions 1634 [2022-11-26 01:00:59,068 INFO L134 LiptonReduction]: Checked pairs total: 1663 [2022-11-26 01:00:59,068 INFO L136 LiptonReduction]: Total number of compositions: 93 [2022-11-26 01:00:59,077 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 15 transitions, 35 flow [2022-11-26 01:00:59,092 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 53 states, 31 states have (on average 3.032258064516129) internal successors, (94), 52 states have internal predecessors, (94), 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-26 01:00:59,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:00:59,118 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;@6694a7e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:00:59,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-26 01:00:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 3.032258064516129) internal successors, (94), 52 states have internal predecessors, (94), 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-26 01:00:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:00:59,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:00:59,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:00:59,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-11-26 01:00:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:00:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 13423, now seen corresponding path program 1 times [2022-11-26 01:00:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:00:59,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336355707] [2022-11-26 01:00:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:00:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:59,408 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-26 01:00:59,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:00:59,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336355707] [2022-11-26 01:00:59,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336355707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:00:59,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:00:59,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:00:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856020924] [2022-11-26 01:00:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:00:59,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:00:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:00:59,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:00:59,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:00:59,454 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 3.032258064516129) internal successors, (94), 52 states have internal predecessors, (94), 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-26 01:00:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:00:59,502 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. [2022-11-26 01:00:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:00:59,504 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-26 01:00:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:00:59,513 INFO L225 Difference]: With dead ends: 29 [2022-11-26 01:00:59,513 INFO L226 Difference]: Without dead ends: 29 [2022-11-26 01:00:59,515 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-26 01:00:59,519 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:00:59,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:00:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-26 01:00:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-26 01:00:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 2.227272727272727) internal successors, (49), 28 states have internal predecessors, (49), 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-26 01:00:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2022-11-26 01:00:59,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 2 [2022-11-26 01:00:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:00:59,559 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2022-11-26 01:00:59,563 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-26 01:00:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2022-11-26 01:00:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:00:59,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:00:59,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:00:59,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:00:59,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-11-26 01:00:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:00:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 13424, now seen corresponding path program 1 times [2022-11-26 01:00:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:00:59,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712615466] [2022-11-26 01:00:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:00:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:59,748 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-26 01:00:59,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:00:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712615466] [2022-11-26 01:00:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712615466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:00:59,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:00:59,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:00:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029106690] [2022-11-26 01:00:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:00:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:00:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:00:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:00:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:00:59,759 INFO L87 Difference]: Start difference. First operand 29 states and 49 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-26 01:00:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:00:59,776 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2022-11-26 01:00:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:00:59,777 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-26 01:00:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:00:59,778 INFO L225 Difference]: With dead ends: 23 [2022-11-26 01:00:59,778 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 01:00:59,779 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-26 01:00:59,780 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:00:59,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:00:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 01:00:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 01:00:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.9) internal successors, (38), 22 states have internal predecessors, (38), 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-26 01:00:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-11-26 01:00:59,785 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 2 [2022-11-26 01:00:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:00:59,785 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2022-11-26 01:00:59,785 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-26 01:00:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2022-11-26 01:00:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:00:59,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:00:59,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:00:59,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:00:59,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-11-26 01:00:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:00:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash 400153625, now seen corresponding path program 1 times [2022-11-26 01:00:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:00:59,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23128917] [2022-11-26 01:00:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:00:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:00:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:00:59,975 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-26 01:00:59,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:00:59,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23128917] [2022-11-26 01:00:59,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23128917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:00:59,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:00:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:00:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797581592] [2022-11-26 01:00:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:00:59,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:00:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:00:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:00:59,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:00:59,978 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:00,018 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2022-11-26 01:01:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:00,020 INFO L225 Difference]: With dead ends: 19 [2022-11-26 01:01:00,020 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 01:01:00,020 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-26 01:01:00,021 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:00,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 01:01:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-26 01:01:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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-26 01:01:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-11-26 01:01:00,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 5 [2022-11-26 01:01:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:00,026 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2022-11-26 01:01:00,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2022-11-26 01:01:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:01:00,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:00,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:01:00,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:01:00,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-11-26 01:01:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 400153626, now seen corresponding path program 1 times [2022-11-26 01:01:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:00,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121319683] [2022-11-26 01:01:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:00,220 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-26 01:01:00,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121319683] [2022-11-26 01:01:00,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121319683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:00,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:00,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730618691] [2022-11-26 01:01:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:00,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:00,223 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:00,273 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2022-11-26 01:01:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:00,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:00,274 INFO L225 Difference]: With dead ends: 23 [2022-11-26 01:01:00,274 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 01:01:00,275 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-26 01:01:00,276 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:00,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 01:01:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 01:01:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 22 states have internal predecessors, (38), 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-26 01:01:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-11-26 01:01:00,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2022-11-26 01:01:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:00,282 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2022-11-26 01:01:00,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2022-11-26 01:01:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 01:01:00,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:00,283 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-26 01:01:00,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:01:00,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-11-26 01:01:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -480205029, now seen corresponding path program 1 times [2022-11-26 01:01:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369491687] [2022-11-26 01:01:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:00,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 01:01:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:00,328 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 01:01:00,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 01:01:00,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-11-26 01:01:00,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-11-26 01:01:00,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-26 01:01:00,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2022-11-26 01:01:00,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 10 remaining) [2022-11-26 01:01:00,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-26 01:01:00,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2022-11-26 01:01:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2022-11-26 01:01:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-11-26 01:01:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-26 01:01:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:01:00,339 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-26 01:01:00,341 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-26 01:01:00,341 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-26 01:01:00,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 01:01:00,376 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:01:00,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 131 transitions, 274 flow [2022-11-26 01:01:00,377 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 131 transitions, 274 flow [2022-11-26 01:01:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 131 transitions, 274 flow [2022-11-26 01:01:00,422 INFO L130 PetriNetUnfolder]: 13/165 cut-off events. [2022-11-26 01:01:00,422 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 01:01:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 13/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 356 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 104. Up to 6 conditions per place. [2022-11-26 01:01:00,431 INFO L119 LiptonReduction]: Number of co-enabled transitions 7052 [2022-11-26 01:01:03,835 INFO L134 LiptonReduction]: Checked pairs total: 11993 [2022-11-26 01:01:03,835 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-11-26 01:01:03,836 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions, 82 flow [2022-11-26 01:01:03,948 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1181 states, 1084 states have (on average 3.2555350553505535) internal successors, (3529), 1180 states have internal predecessors, (3529), 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-26 01:01:03,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:01:03,953 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;@6694a7e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:01:03,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-26 01:01:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 1084 states have (on average 3.2555350553505535) internal successors, (3529), 1180 states have internal predecessors, (3529), 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-26 01:01:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:03,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:03,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:03,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 23101, now seen corresponding path program 1 times [2022-11-26 01:01:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:03,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101608808] [2022-11-26 01:01:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:03,987 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-26 01:01:03,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:03,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101608808] [2022-11-26 01:01:03,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101608808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:03,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:03,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308499287] [2022-11-26 01:01:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:03,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 01:01:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 01:01:03,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:01:03,995 INFO L87 Difference]: Start difference. First operand has 1181 states, 1084 states have (on average 3.2555350553505535) internal successors, (3529), 1180 states have internal predecessors, (3529), 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 2 states, 1 states have (on average 2.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-26 01:01:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,056 INFO L93 Difference]: Finished difference Result 918 states and 2717 transitions. [2022-11-26 01:01:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 01:01:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.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-26 01:01:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,069 INFO L225 Difference]: With dead ends: 918 [2022-11-26 01:01:04,069 INFO L226 Difference]: Without dead ends: 918 [2022-11-26 01:01:04,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:01:04,070 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-26 01:01:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-11-26 01:01:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 860 states have (on average 3.1593023255813955) internal successors, (2717), 917 states have internal predecessors, (2717), 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-26 01:01:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2717 transitions. [2022-11-26 01:01:04,157 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 2717 transitions. Word has length 2 [2022-11-26 01:01:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,157 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 2717 transitions. [2022-11-26 01:01:04,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.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-26 01:01:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2717 transitions. [2022-11-26 01:01:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:04,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:04,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:01:04,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 23097, now seen corresponding path program 1 times [2022-11-26 01:01:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878375660] [2022-11-26 01:01:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:04,223 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-26 01:01:04,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:04,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878375660] [2022-11-26 01:01:04,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878375660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:04,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:04,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142325330] [2022-11-26 01:01:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:04,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:04,227 INFO L87 Difference]: Start difference. First operand 918 states and 2717 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-26 01:01:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,287 INFO L93 Difference]: Finished difference Result 785 states and 2308 transitions. [2022-11-26 01:01:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:04,288 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-26 01:01:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,302 INFO L225 Difference]: With dead ends: 785 [2022-11-26 01:01:04,302 INFO L226 Difference]: Without dead ends: 785 [2022-11-26 01:01:04,303 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-26 01:01:04,305 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-26 01:01:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-11-26 01:01:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 748 states have (on average 3.085561497326203) internal successors, (2308), 784 states have internal predecessors, (2308), 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-26 01:01:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2308 transitions. [2022-11-26 01:01:04,375 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2308 transitions. Word has length 2 [2022-11-26 01:01:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,376 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 2308 transitions. [2022-11-26 01:01:04,376 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-26 01:01:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2308 transitions. [2022-11-26 01:01:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:04,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:04,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:01:04,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 23098, now seen corresponding path program 1 times [2022-11-26 01:01:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175129368] [2022-11-26 01:01:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:04,411 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-26 01:01:04,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:04,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175129368] [2022-11-26 01:01:04,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175129368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:04,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:04,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448526716] [2022-11-26 01:01:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:04,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:04,414 INFO L87 Difference]: Start difference. First operand 785 states and 2308 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-26 01:01:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,460 INFO L93 Difference]: Finished difference Result 652 states and 1899 transitions. [2022-11-26 01:01:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:04,461 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-26 01:01:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,466 INFO L225 Difference]: With dead ends: 652 [2022-11-26 01:01:04,467 INFO L226 Difference]: Without dead ends: 652 [2022-11-26 01:01:04,467 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-26 01:01:04,468 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-26 01:01:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-11-26 01:01:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 636 states have (on average 2.9858490566037736) internal successors, (1899), 651 states have internal predecessors, (1899), 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-26 01:01:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1899 transitions. [2022-11-26 01:01:04,495 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1899 transitions. Word has length 2 [2022-11-26 01:01:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,496 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1899 transitions. [2022-11-26 01:01:04,496 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-26 01:01:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1899 transitions. [2022-11-26 01:01:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:01:04,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:01:04,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:01:04,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 688618039, now seen corresponding path program 1 times [2022-11-26 01:01:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677226281] [2022-11-26 01:01:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:04,576 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-26 01:01:04,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:04,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677226281] [2022-11-26 01:01:04,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677226281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:04,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:04,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823538021] [2022-11-26 01:01:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:04,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:04,578 INFO L87 Difference]: Start difference. First operand 652 states and 1899 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,635 INFO L93 Difference]: Finished difference Result 543 states and 1587 transitions. [2022-11-26 01:01:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,639 INFO L225 Difference]: With dead ends: 543 [2022-11-26 01:01:04,640 INFO L226 Difference]: Without dead ends: 543 [2022-11-26 01:01:04,640 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-26 01:01:04,641 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-26 01:01:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2022-11-26 01:01:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 534 states have (on average 2.9719101123595504) internal successors, (1587), 542 states have internal predecessors, (1587), 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-26 01:01:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1587 transitions. [2022-11-26 01:01:04,696 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1587 transitions. Word has length 5 [2022-11-26 01:01:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,696 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1587 transitions. [2022-11-26 01:01:04,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1587 transitions. [2022-11-26 01:01:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:01:04,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:01:04,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:01:04,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 688618040, now seen corresponding path program 1 times [2022-11-26 01:01:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718325294] [2022-11-26 01:01:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:04,845 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-26 01:01:04,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:04,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718325294] [2022-11-26 01:01:04,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718325294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:04,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:04,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554860369] [2022-11-26 01:01:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:04,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:04,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:04,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:04,848 INFO L87 Difference]: Start difference. First operand 543 states and 1587 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,935 INFO L93 Difference]: Finished difference Result 921 states and 2712 transitions. [2022-11-26 01:01:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,942 INFO L225 Difference]: With dead ends: 921 [2022-11-26 01:01:04,942 INFO L226 Difference]: Without dead ends: 921 [2022-11-26 01:01:04,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:04,943 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 24 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-26 01:01:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 597. [2022-11-26 01:01:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 588 states have (on average 2.9591836734693877) internal successors, (1740), 596 states have internal predecessors, (1740), 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-26 01:01:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1740 transitions. [2022-11-26 01:01:04,971 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1740 transitions. Word has length 5 [2022-11-26 01:01:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,971 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1740 transitions. [2022-11-26 01:01:04,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1740 transitions. [2022-11-26 01:01:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:01:04,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:04,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 01:01:04,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1742818807, now seen corresponding path program 1 times [2022-11-26 01:01:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056292766] [2022-11-26 01:01:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:05,001 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-26 01:01:05,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:05,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056292766] [2022-11-26 01:01:05,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056292766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:05,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:05,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996795476] [2022-11-26 01:01:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:05,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:05,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:05,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:05,004 INFO L87 Difference]: Start difference. First operand 597 states and 1740 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:05,091 INFO L93 Difference]: Finished difference Result 813 states and 2373 transitions. [2022-11-26 01:01:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:05,097 INFO L225 Difference]: With dead ends: 813 [2022-11-26 01:01:05,098 INFO L226 Difference]: Without dead ends: 813 [2022-11-26 01:01:05,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 01:01:05,099 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:05,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-11-26 01:01:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 678. [2022-11-26 01:01:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 669 states have (on average 2.9596412556053813) internal successors, (1980), 677 states have internal predecessors, (1980), 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-26 01:01:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1980 transitions. [2022-11-26 01:01:05,127 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1980 transitions. Word has length 9 [2022-11-26 01:01:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:05,127 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1980 transitions. [2022-11-26 01:01:05,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1980 transitions. [2022-11-26 01:01:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:01:05,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:05,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:05,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 01:01:05,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1745334271, now seen corresponding path program 1 times [2022-11-26 01:01:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:05,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535360567] [2022-11-26 01:01:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:05,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:05,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535360567] [2022-11-26 01:01:05,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535360567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:05,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:05,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519032047] [2022-11-26 01:01:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:05,272 INFO L87 Difference]: Start difference. First operand 678 states and 1980 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 01:01:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:05,355 INFO L93 Difference]: Finished difference Result 778 states and 2270 transitions. [2022-11-26 01:01:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 9 [2022-11-26 01:01:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:05,361 INFO L225 Difference]: With dead ends: 778 [2022-11-26 01:01:05,362 INFO L226 Difference]: Without dead ends: 778 [2022-11-26 01:01:05,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:05,363 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:05,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-26 01:01:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 728. [2022-11-26 01:01:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 719 states have (on average 3.0250347705146035) internal successors, (2175), 727 states have internal predecessors, (2175), 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-26 01:01:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2175 transitions. [2022-11-26 01:01:05,397 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2175 transitions. Word has length 9 [2022-11-26 01:01:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:05,397 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2175 transitions. [2022-11-26 01:01:05,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 01:01:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2175 transitions. [2022-11-26 01:01:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:01:05,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:05,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 01:01:05,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1807188788, now seen corresponding path program 1 times [2022-11-26 01:01:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:05,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872422768] [2022-11-26 01:01:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:05,751 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-26 01:01:05,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:05,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872422768] [2022-11-26 01:01:05,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872422768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:05,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17473699] [2022-11-26 01:01:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:05,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:05,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:05,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:01:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:05,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-26 01:01:05,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:06,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:06,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 01:01:06,258 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-26 01:01:06,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:06,427 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-26 01:01:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17473699] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:06,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440124085] [2022-11-26 01:01:06,443 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:06,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:06,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 01:01:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331876436] [2022-11-26 01:01:06,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:06,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:01:06,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:01:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-26 01:01:06,455 INFO L87 Difference]: Start difference. First operand 728 states and 2175 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:06,878 INFO L93 Difference]: Finished difference Result 1706 states and 5143 transitions. [2022-11-26 01:01:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:01:06,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:01:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:06,891 INFO L225 Difference]: With dead ends: 1706 [2022-11-26 01:01:06,891 INFO L226 Difference]: Without dead ends: 1706 [2022-11-26 01:01:06,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:01:06,894 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 244 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:06,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 120 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-11-26 01:01:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1172. [2022-11-26 01:01:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1163 states have (on average 3.122957867583835) internal successors, (3632), 1171 states have internal predecessors, (3632), 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-26 01:01:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 3632 transitions. [2022-11-26 01:01:06,971 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 3632 transitions. Word has length 10 [2022-11-26 01:01:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:06,971 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 3632 transitions. [2022-11-26 01:01:06,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 3632 transitions. [2022-11-26 01:01:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:01:06,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:06,975 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-26 01:01:07,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:01:07,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:01:07,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-11-26 01:01:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2058038157, now seen corresponding path program 1 times [2022-11-26 01:01:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053912797] [2022-11-26 01:01:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:07,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 01:01:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:07,251 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 01:01:07,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 01:01:07,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2022-11-26 01:01:07,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2022-11-26 01:01:07,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-26 01:01:07,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2022-11-26 01:01:07,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (8 of 13 remaining) [2022-11-26 01:01:07,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-26 01:01:07,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-26 01:01:07,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-26 01:01:07,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2022-11-26 01:01:07,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2022-11-26 01:01:07,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2022-11-26 01:01:07,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2022-11-26 01:01:07,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-26 01:01:07,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 01:01:07,263 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:07,264 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-26 01:01:07,264 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-26 01:01:07,297 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 01:01:07,300 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:01:07,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 175 transitions, 371 flow [2022-11-26 01:01:07,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 175 transitions, 371 flow [2022-11-26 01:01:07,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 175 transitions, 371 flow [2022-11-26 01:01:07,345 INFO L130 PetriNetUnfolder]: 19/227 cut-off events. [2022-11-26 01:01:07,345 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-26 01:01:07,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 227 events. 19/227 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 633 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2022-11-26 01:01:07,359 INFO L119 LiptonReduction]: Number of co-enabled transitions 16254 [2022-11-26 01:01:11,564 INFO L134 LiptonReduction]: Checked pairs total: 27514 [2022-11-26 01:01:11,564 INFO L136 LiptonReduction]: Total number of compositions: 166 [2022-11-26 01:01:11,565 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 48 transitions, 117 flow [2022-11-26 01:01:12,048 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13038 states, 12638 states have (on average 4.202642823231524) internal successors, (53113), 13037 states have internal predecessors, (53113), 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-26 01:01:12,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:01:12,061 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;@6694a7e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:01:12,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-26 01:01:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 13038 states, 12638 states have (on average 4.202642823231524) internal successors, (53113), 13037 states have internal predecessors, (53113), 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-26 01:01:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:12,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:12,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:12,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 35365, now seen corresponding path program 1 times [2022-11-26 01:01:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:12,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883494669] [2022-11-26 01:01:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:12,137 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-26 01:01:12,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:12,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883494669] [2022-11-26 01:01:12,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883494669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:12,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:12,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022631410] [2022-11-26 01:01:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:12,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:12,191 INFO L87 Difference]: Start difference. First operand has 13038 states, 12638 states have (on average 4.202642823231524) internal successors, (53113), 13037 states have internal predecessors, (53113), 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-26 01:01:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:12,474 INFO L93 Difference]: Finished difference Result 8650 states and 34835 transitions. [2022-11-26 01:01:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:12,475 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-26 01:01:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:12,697 INFO L225 Difference]: With dead ends: 8650 [2022-11-26 01:01:12,697 INFO L226 Difference]: Without dead ends: 8650 [2022-11-26 01:01:12,698 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-26 01:01:12,699 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:12,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2022-11-26 01:01:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2022-11-26 01:01:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8650 states, 8501 states have (on average 4.097753205505235) internal successors, (34835), 8649 states have internal predecessors, (34835), 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-26 01:01:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 34835 transitions. [2022-11-26 01:01:13,311 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 34835 transitions. Word has length 2 [2022-11-26 01:01:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:13,312 INFO L495 AbstractCegarLoop]: Abstraction has 8650 states and 34835 transitions. [2022-11-26 01:01:13,312 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-26 01:01:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 34835 transitions. [2022-11-26 01:01:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:13,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:13,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 01:01:13,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 35367, now seen corresponding path program 1 times [2022-11-26 01:01:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014786117] [2022-11-26 01:01:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:13,380 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-26 01:01:13,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:13,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014786117] [2022-11-26 01:01:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014786117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067799317] [2022-11-26 01:01:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:13,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:13,383 INFO L87 Difference]: Start difference. First operand 8650 states and 34835 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-26 01:01:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:13,595 INFO L93 Difference]: Finished difference Result 7186 states and 28739 transitions. [2022-11-26 01:01:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:13,596 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-26 01:01:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:13,646 INFO L225 Difference]: With dead ends: 7186 [2022-11-26 01:01:13,646 INFO L226 Difference]: Without dead ends: 7186 [2022-11-26 01:01:13,646 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-26 01:01:13,647 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:13,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2022-11-26 01:01:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 7186. [2022-11-26 01:01:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7122 states have (on average 4.035242909295142) internal successors, (28739), 7185 states have internal predecessors, (28739), 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-26 01:01:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 28739 transitions. [2022-11-26 01:01:14,187 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 28739 transitions. Word has length 2 [2022-11-26 01:01:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:14,187 INFO L495 AbstractCegarLoop]: Abstraction has 7186 states and 28739 transitions. [2022-11-26 01:01:14,188 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-26 01:01:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 28739 transitions. [2022-11-26 01:01:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:01:14,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:14,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:01:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 01:01:14,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1054498345, now seen corresponding path program 1 times [2022-11-26 01:01:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:14,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857609306] [2022-11-26 01:01:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:14,272 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-26 01:01:14,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:14,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857609306] [2022-11-26 01:01:14,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857609306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:14,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:14,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386761417] [2022-11-26 01:01:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:14,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:14,278 INFO L87 Difference]: Start difference. First operand 7186 states and 28739 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:14,558 INFO L93 Difference]: Finished difference Result 5443 states and 21867 transitions. [2022-11-26 01:01:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:14,615 INFO L225 Difference]: With dead ends: 5443 [2022-11-26 01:01:14,615 INFO L226 Difference]: Without dead ends: 5443 [2022-11-26 01:01:14,617 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-26 01:01:14,618 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:14,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:01:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2022-11-26 01:01:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5443. [2022-11-26 01:01:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5416 states have (on average 4.03748153618907) internal successors, (21867), 5442 states have internal predecessors, (21867), 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-26 01:01:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 21867 transitions. [2022-11-26 01:01:14,912 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 21867 transitions. Word has length 5 [2022-11-26 01:01:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:14,913 INFO L495 AbstractCegarLoop]: Abstraction has 5443 states and 21867 transitions. [2022-11-26 01:01:14,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 21867 transitions. [2022-11-26 01:01:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:01:14,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:14,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:01:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 01:01:14,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1054498346, now seen corresponding path program 1 times [2022-11-26 01:01:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326000697] [2022-11-26 01:01:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:15,080 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-26 01:01:15,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:15,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326000697] [2022-11-26 01:01:15,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326000697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:15,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:15,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904428814] [2022-11-26 01:01:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:15,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:15,084 INFO L87 Difference]: Start difference. First operand 5443 states and 21867 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:15,268 INFO L93 Difference]: Finished difference Result 6531 states and 26131 transitions. [2022-11-26 01:01:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:01:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:15,415 INFO L225 Difference]: With dead ends: 6531 [2022-11-26 01:01:15,418 INFO L226 Difference]: Without dead ends: 6531 [2022-11-26 01:01:15,418 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-26 01:01:15,419 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:15,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2022-11-26 01:01:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 5987. [2022-11-26 01:01:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5987 states, 5960 states have (on average 4.1179530201342285) internal successors, (24543), 5986 states have internal predecessors, (24543), 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-26 01:01:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 24543 transitions. [2022-11-26 01:01:15,790 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 24543 transitions. Word has length 5 [2022-11-26 01:01:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:15,791 INFO L495 AbstractCegarLoop]: Abstraction has 5987 states and 24543 transitions. [2022-11-26 01:01:15,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 24543 transitions. [2022-11-26 01:01:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:01:15,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:15,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:15,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 01:01:15,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1986998900, now seen corresponding path program 1 times [2022-11-26 01:01:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:15,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295373695] [2022-11-26 01:01:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:15,838 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-26 01:01:15,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295373695] [2022-11-26 01:01:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295373695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:15,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:15,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7985482] [2022-11-26 01:01:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:15,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:15,841 INFO L87 Difference]: Start difference. First operand 5987 states and 24543 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:16,245 INFO L93 Difference]: Finished difference Result 8642 states and 34995 transitions. [2022-11-26 01:01:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:16,328 INFO L225 Difference]: With dead ends: 8642 [2022-11-26 01:01:16,328 INFO L226 Difference]: Without dead ends: 8642 [2022-11-26 01:01:16,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 01:01:16,329 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:16,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 20 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2022-11-26 01:01:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 7036. [2022-11-26 01:01:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7036 states, 7009 states have (on average 4.0933086032244255) internal successors, (28690), 7035 states have internal predecessors, (28690), 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-26 01:01:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7036 states to 7036 states and 28690 transitions. [2022-11-26 01:01:16,853 INFO L78 Accepts]: Start accepts. Automaton has 7036 states and 28690 transitions. Word has length 9 [2022-11-26 01:01:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:16,854 INFO L495 AbstractCegarLoop]: Abstraction has 7036 states and 28690 transitions. [2022-11-26 01:01:16,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-26 01:01:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7036 states and 28690 transitions. [2022-11-26 01:01:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:01:16,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:16,855 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 01:01:16,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 404678440, now seen corresponding path program 1 times [2022-11-26 01:01:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127287334] [2022-11-26 01:01:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:17,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:17,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127287334] [2022-11-26 01:01:17,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127287334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:17,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:17,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:17,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922982957] [2022-11-26 01:01:17,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:17,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:17,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:17,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:17,069 INFO L87 Difference]: Start difference. First operand 7036 states and 28690 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 01:01:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:17,310 INFO L93 Difference]: Finished difference Result 11842 states and 48586 transitions. [2022-11-26 01:01:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:17,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 9 [2022-11-26 01:01:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:17,540 INFO L225 Difference]: With dead ends: 11842 [2022-11-26 01:01:17,541 INFO L226 Difference]: Without dead ends: 11842 [2022-11-26 01:01:17,541 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-26 01:01:17,543 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:17,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 33 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2022-11-26 01:01:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 7711. [2022-11-26 01:01:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7711 states, 7684 states have (on average 4.08589276418532) internal successors, (31396), 7710 states have internal predecessors, (31396), 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-26 01:01:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7711 states to 7711 states and 31396 transitions. [2022-11-26 01:01:17,977 INFO L78 Accepts]: Start accepts. Automaton has 7711 states and 31396 transitions. Word has length 9 [2022-11-26 01:01:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:17,978 INFO L495 AbstractCegarLoop]: Abstraction has 7711 states and 31396 transitions. [2022-11-26 01:01:17,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 01:01:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7711 states and 31396 transitions. [2022-11-26 01:01:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:01:17,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:17,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:17,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 01:01:17,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1467427001, now seen corresponding path program 1 times [2022-11-26 01:01:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:17,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703923955] [2022-11-26 01:01:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:18,253 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-26 01:01:18,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703923955] [2022-11-26 01:01:18,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703923955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:18,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111628314] [2022-11-26 01:01:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:18,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:18,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:18,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:01:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:18,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 01:01:18,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:18,390 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:01:18,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-26 01:01:18,414 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 01:01:18,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 01:01:18,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 01:01:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:18,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-11-26 01:01:18,875 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-26 01:01:18,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:19,209 WARN L837 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_thr1Thread1of3ForFork0_~offset~0#1_33_49| Int) (v_ArrVal_91 (Array Int Int))) (let ((.cse2 (* |aux_div_v_thr1Thread1of3ForFork0_~offset~0#1_33_49| 8))) (let ((.cse1 (* 2 |aux_div_v_thr1Thread1of3ForFork0_~offset~0#1_33_49|)) (.cse0 (+ .cse2 |c_~#storage~0.offset|))) (or (< .cse0 0) (< .cse1 0) (<= (+ .cse2 8 |c_~#storage~0.offset|) (select |c_#length| |c_~#storage~0.base|)) (<= 6 .cse1) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#storage~0.base|) .cse0)))))) is different from false [2022-11-26 01:01:19,212 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-26 01:01:19,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111628314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:19,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399049898] [2022-11-26 01:01:19,213 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:19,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:19,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2022-11-26 01:01:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574785798] [2022-11-26 01:01:19,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:19,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 01:01:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 01:01:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-11-26 01:01:19,217 INFO L87 Difference]: Start difference. First operand 7711 states and 31396 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:22,307 INFO L93 Difference]: Finished difference Result 56531 states and 225357 transitions. [2022-11-26 01:01:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:01:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:01:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:22,884 INFO L225 Difference]: With dead ends: 56531 [2022-11-26 01:01:22,885 INFO L226 Difference]: Without dead ends: 56531 [2022-11-26 01:01:22,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=301, Invalid=824, Unknown=1, NotChecked=64, Total=1190 [2022-11-26 01:01:22,887 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1098 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:22,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 192 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1326 Invalid, 0 Unknown, 90 Unchecked, 1.5s Time] [2022-11-26 01:01:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56531 states. [2022-11-26 01:01:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56531 to 30149. [2022-11-26 01:01:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30149 states, 30122 states have (on average 4.275346922515105) internal successors, (128782), 30148 states have internal predecessors, (128782), 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-26 01:01:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30149 states to 30149 states and 128782 transitions. [2022-11-26 01:01:25,613 INFO L78 Accepts]: Start accepts. Automaton has 30149 states and 128782 transitions. Word has length 10 [2022-11-26 01:01:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:25,614 INFO L495 AbstractCegarLoop]: Abstraction has 30149 states and 128782 transitions. [2022-11-26 01:01:25,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:01:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30149 states and 128782 transitions. [2022-11-26 01:01:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:01:25,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:25,616 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:25,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:25,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:25,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1807804696, now seen corresponding path program 1 times [2022-11-26 01:01:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:25,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423529192] [2022-11-26 01:01:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:25,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423529192] [2022-11-26 01:01:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423529192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:25,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:25,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273472280] [2022-11-26 01:01:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:25,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:25,854 INFO L87 Difference]: Start difference. First operand 30149 states and 128782 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-26 01:01:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:26,610 INFO L93 Difference]: Finished difference Result 42047 states and 178899 transitions. [2022-11-26 01:01:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-26 01:01:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:26,859 INFO L225 Difference]: With dead ends: 42047 [2022-11-26 01:01:26,859 INFO L226 Difference]: Without dead ends: 42047 [2022-11-26 01:01:26,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 01:01:26,861 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:26,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 20 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42047 states. [2022-11-26 01:01:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42047 to 33416. [2022-11-26 01:01:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33416 states, 33389 states have (on average 4.2705981011710445) internal successors, (142591), 33415 states have internal predecessors, (142591), 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-26 01:01:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33416 states to 33416 states and 142591 transitions. [2022-11-26 01:01:28,875 INFO L78 Accepts]: Start accepts. Automaton has 33416 states and 142591 transitions. Word has length 13 [2022-11-26 01:01:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:28,877 INFO L495 AbstractCegarLoop]: Abstraction has 33416 states and 142591 transitions. [2022-11-26 01:01:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-26 01:01:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33416 states and 142591 transitions. [2022-11-26 01:01:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:01:28,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:28,879 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-26 01:01:28,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 932774059, now seen corresponding path program 1 times [2022-11-26 01:01:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346014584] [2022-11-26 01:01:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:01:29,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346014584] [2022-11-26 01:01:29,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346014584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:29,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:29,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:01:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727175293] [2022-11-26 01:01:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:29,074 INFO L87 Difference]: Start difference. First operand 33416 states and 142591 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-26 01:01:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:30,232 INFO L93 Difference]: Finished difference Result 53806 states and 231663 transitions. [2022-11-26 01:01:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 13 [2022-11-26 01:01:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:30,603 INFO L225 Difference]: With dead ends: 53806 [2022-11-26 01:01:30,603 INFO L226 Difference]: Without dead ends: 53806 [2022-11-26 01:01:30,603 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-26 01:01:30,604 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:30,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 33 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53806 states. [2022-11-26 01:01:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53806 to 36151. [2022-11-26 01:01:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36151 states, 36124 states have (on average 4.267910530395305) internal successors, (154174), 36150 states have internal predecessors, (154174), 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-26 01:01:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36151 states to 36151 states and 154174 transitions. [2022-11-26 01:01:32,488 INFO L78 Accepts]: Start accepts. Automaton has 36151 states and 154174 transitions. Word has length 13 [2022-11-26 01:01:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:32,488 INFO L495 AbstractCegarLoop]: Abstraction has 36151 states and 154174 transitions. [2022-11-26 01:01:32,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-26 01:01:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 36151 states and 154174 transitions. [2022-11-26 01:01:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:01:32,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:32,490 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:32,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 01:01:32,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash -207367132, now seen corresponding path program 1 times [2022-11-26 01:01:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324905186] [2022-11-26 01:01:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 01:01:32,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:32,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324905186] [2022-11-26 01:01:32,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324905186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:32,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220027425] [2022-11-26 01:01:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:32,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:32,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:32,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:32,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:01:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:33,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-26 01:01:33,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:33,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:33,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 01:01:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:33,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:33,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220027425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639189222] [2022-11-26 01:01:33,441 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:33,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:33,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-11-26 01:01:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670204380] [2022-11-26 01:01:33,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:01:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:01:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:01:33,444 INFO L87 Difference]: Start difference. First operand 36151 states and 154174 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-26 01:01:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:35,185 INFO L93 Difference]: Finished difference Result 84319 states and 361838 transitions. [2022-11-26 01:01:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:01:35,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-26 01:01:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:35,756 INFO L225 Difference]: With dead ends: 84319 [2022-11-26 01:01:35,756 INFO L226 Difference]: Without dead ends: 84319 [2022-11-26 01:01:35,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:01:35,758 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 397 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:35,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 159 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:01:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84319 states. [2022-11-26 01:01:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84319 to 57777. [2022-11-26 01:01:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57777 states, 57750 states have (on average 4.376796536796537) internal successors, (252760), 57776 states have internal predecessors, (252760), 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-26 01:01:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57777 states to 57777 states and 252760 transitions. [2022-11-26 01:01:38,446 INFO L78 Accepts]: Start accepts. Automaton has 57777 states and 252760 transitions. Word has length 14 [2022-11-26 01:01:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:38,446 INFO L495 AbstractCegarLoop]: Abstraction has 57777 states and 252760 transitions. [2022-11-26 01:01:38,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-26 01:01:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 57777 states and 252760 transitions. [2022-11-26 01:01:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 01:01:38,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:38,449 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-26 01:01:38,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:38,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bcae006-54fb-4b96-9650-c5884d1716c4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 01:01:38,654 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-11-26 01:01:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1262678937, now seen corresponding path program 1 times [2022-11-26 01:01:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61680644] [2022-11-26 01:01:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:38,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 01:01:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 01:01:38,684 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 01:01:38,684 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 01:01:38,685 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2022-11-26 01:01:38,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2022-11-26 01:01:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-26 01:01:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2022-11-26 01:01:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (11 of 16 remaining) [2022-11-26 01:01:38,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-26 01:01:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-26 01:01:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-26 01:01:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-26 01:01:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2022-11-26 01:01:38,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2022-11-26 01:01:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2022-11-26 01:01:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2022-11-26 01:01:38,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2022-11-26 01:01:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2022-11-26 01:01:38,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-26 01:01:38,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 01:01:38,690 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:38,690 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-26 01:01:38,690 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-26 01:01:38,728 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 01:01:38,734 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:01:38,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 219 transitions, 470 flow [2022-11-26 01:01:38,735 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 219 transitions, 470 flow [2022-11-26 01:01:38,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 219 transitions, 470 flow [2022-11-26 01:01:38,826 INFO L130 PetriNetUnfolder]: 25/289 cut-off events. [2022-11-26 01:01:38,826 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-26 01:01:38,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 289 events. 25/289 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 927 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 235. Up to 10 conditions per place. [2022-11-26 01:01:38,852 INFO L119 LiptonReduction]: Number of co-enabled transitions 29240 [2022-11-26 01:01:44,404 INFO L134 LiptonReduction]: Checked pairs total: 50999 [2022-11-26 01:01:44,404 INFO L136 LiptonReduction]: Total number of compositions: 216 [2022-11-26 01:01:44,407 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 61 transitions, 154 flow [2022-11-26 01:01:49,215 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 143475 states, 141860 states have (on average 5.222557451008036) internal successors, (740872), 143474 states have internal predecessors, (740872), 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-26 01:01:49,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:01:49,217 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;@6694a7e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:01:49,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-11-26 01:01:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 143475 states, 141860 states have (on average 5.222557451008036) internal successors, (740872), 143474 states have internal predecessors, (740872), 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-26 01:01:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:49,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:49,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:49,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-11-26 01:01:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 50646, now seen corresponding path program 1 times [2022-11-26 01:01:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:49,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20059127] [2022-11-26 01:01:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:49,421 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-26 01:01:49,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:49,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20059127] [2022-11-26 01:01:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20059127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709930264] [2022-11-26 01:01:49,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:49,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:49,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:49,614 INFO L87 Difference]: Start difference. First operand has 143475 states, 141860 states have (on average 5.222557451008036) internal successors, (740872), 143474 states have internal predecessors, (740872), 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-26 01:01:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:51,758 INFO L93 Difference]: Finished difference Result 95165 states and 487012 transitions. [2022-11-26 01:01:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:51,758 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-26 01:01:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:52,727 INFO L225 Difference]: With dead ends: 95165 [2022-11-26 01:01:52,727 INFO L226 Difference]: Without dead ends: 95165 [2022-11-26 01:01:52,728 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-26 01:01:52,728 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:52,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 15 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95165 states. [2022-11-26 01:01:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95165 to 95165. [2022-11-26 01:01:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95165 states, 94568 states have (on average 5.149860417900347) internal successors, (487012), 95164 states have internal predecessors, (487012), 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-26 01:01:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95165 states to 95165 states and 487012 transitions. [2022-11-26 01:01:58,968 INFO L78 Accepts]: Start accepts. Automaton has 95165 states and 487012 transitions. Word has length 2 [2022-11-26 01:01:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:58,968 INFO L495 AbstractCegarLoop]: Abstraction has 95165 states and 487012 transitions. [2022-11-26 01:01:58,968 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-26 01:01:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 95165 states and 487012 transitions. [2022-11-26 01:01:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:01:58,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:58,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:01:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-26 01:01:58,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-11-26 01:01:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 50647, now seen corresponding path program 1 times [2022-11-26 01:01:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136082305] [2022-11-26 01:01:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:59,009 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-26 01:01:59,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:59,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136082305] [2022-11-26 01:01:59,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136082305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:59,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:01:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858716177] [2022-11-26 01:01:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:59,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:59,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:59,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:59,012 INFO L87 Difference]: Start difference. First operand 95165 states and 487012 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-26 01:02:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:02:01,231 INFO L93 Difference]: Finished difference Result 79060 states and 402387 transitions. [2022-11-26 01:02:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:02:01,231 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-26 01:02:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:02:02,048 INFO L225 Difference]: With dead ends: 79060 [2022-11-26 01:02:02,048 INFO L226 Difference]: Without dead ends: 79060 [2022-11-26 01:02:02,048 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-26 01:02:02,049 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:02:02,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 15 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:02:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79060 states.