./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- 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-25 22:18:11,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:18:11,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:18:11,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:18:11,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:18:11,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:18:11,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:18:11,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:18:11,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:18:11,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:18:11,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:18:11,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:18:11,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:18:11,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:18:11,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:18:11,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:18:11,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:18:11,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:18:11,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:18:11,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:18:11,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:18:11,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:18:11,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:18:11,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:18:11,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:18:11,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:18:11,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:18:11,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:18:11,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:18:11,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:18:11,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:18:11,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:18:11,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:18:11,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:18:11,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:18:11,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:18:11,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:18:11,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:18:11,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:18:11,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:18:11,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:18:11,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:18:11,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:18:11,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:18:11,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:18:11,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:18:11,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:18:11,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:18:11,332 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:18:11,333 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:18:11,333 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:18:11,333 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:18:11,333 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:18:11,334 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:18:11,334 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:18:11,334 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:18:11,334 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:18:11,335 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:18:11,335 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:18:11,335 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:18:11,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:18:11,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:18:11,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:18:11,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:18:11,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:18:11,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:18:11,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:18:11,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:18:11,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:18:11,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:18:11,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:18:11,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:18:11,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:18:11,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:18:11,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:18:11,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:18:11,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:18:11,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:18:11,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:18:11,340 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:18:11,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:18:11,341 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:18:11,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:18:11,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:18:11,342 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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2022-11-25 22:18:11,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:18:11,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:18:11,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:18:11,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:18:11,612 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:18:11,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2022-11-25 22:18:14,862 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:18:15,281 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:18:15,292 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2022-11-25 22:18:15,317 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/26048cf76/b73d43dcf8b241f38e4fdb52b1ae033d/FLAG9af1f13b5 [2022-11-25 22:18:15,337 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/26048cf76/b73d43dcf8b241f38e4fdb52b1ae033d [2022-11-25 22:18:15,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:18:15,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:18:15,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:18:15,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:18:15,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:18:15,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:18:15" (1/1) ... [2022-11-25 22:18:15,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6727abaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:15, skipping insertion in model container [2022-11-25 22:18:15,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:18:15" (1/1) ... [2022-11-25 22:18:15,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:18:15,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:18:16,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:18:16,120 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:18:16,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:18:16,254 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:18:16,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16 WrapperNode [2022-11-25 22:18:16,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:18:16,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:18:16,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:18:16,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:18:16,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,311 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 86 [2022-11-25 22:18:16,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:18:16,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:18:16,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:18:16,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:18:16,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:18:16,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:18:16,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:18:16,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:18:16,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (1/1) ... [2022-11-25 22:18:16,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:18:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:18:16,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:18:16,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:18:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:18:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:18:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:18:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:18:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:18:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 22:18:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:18:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:18:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:18:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 22:18:16,451 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 22:18:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:18:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:18:16,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:18:16,454 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 22:18:16,641 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:18:16,644 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:18:17,199 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:18:17,211 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:18:17,211 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:18:17,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:18:17 BoogieIcfgContainer [2022-11-25 22:18:17,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:18:17,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:18:17,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:18:17,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:18:17,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:18:15" (1/3) ... [2022-11-25 22:18:17,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff4a3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:18:17, skipping insertion in model container [2022-11-25 22:18:17,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:18:16" (2/3) ... [2022-11-25 22:18:17,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff4a3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:18:17, skipping insertion in model container [2022-11-25 22:18:17,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:18:17" (3/3) ... [2022-11-25 22:18:17,230 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2022-11-25 22:18:17,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:18:17,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-25 22:18:17,268 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 22:18:17,386 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 22:18:17,434 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 22:18:17,455 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 171 transitions, 347 flow [2022-11-25 22:18:17,459 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 171 transitions, 347 flow [2022-11-25 22:18:17,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 171 transitions, 347 flow [2022-11-25 22:18:17,568 INFO L130 PetriNetUnfolder]: 0/170 cut-off events. [2022-11-25 22:18:17,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 22:18:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 170 events. 0/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 220 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-11-25 22:18:17,575 INFO L119 LiptonReduction]: Number of co-enabled transitions 2590 [2022-11-25 22:19:23,896 WARN L233 SmtUtils]: Spent 23.51s on a formula simplification. DAG size of input: 239 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:19:33,032 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:19:57,682 WARN L233 SmtUtils]: Spent 24.65s on a formula simplification. DAG size of input: 239 DAG size of output: 230 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:20:08,052 WARN L233 SmtUtils]: Spent 10.36s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:20:35,368 WARN L233 SmtUtils]: Spent 27.31s on a formula simplification. DAG size of input: 244 DAG size of output: 235 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:20:45,494 WARN L233 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 218 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:21:08,139 WARN L233 SmtUtils]: Spent 22.64s on a formula simplification. DAG size of input: 244 DAG size of output: 232 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:21:15,174 WARN L233 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:21:55,451 WARN L233 SmtUtils]: Spent 39.99s on a formula simplification. DAG size of input: 258 DAG size of output: 249 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:22:13,438 WARN L233 SmtUtils]: Spent 17.98s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:23:08,973 WARN L233 SmtUtils]: Spent 55.53s on a formula simplification. DAG size of input: 258 DAG size of output: 249 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:23:29,184 WARN L233 SmtUtils]: Spent 20.21s on a formula simplification that was a NOOP. DAG size: 234 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:24:56,167 WARN L233 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 324 DAG size of output: 315 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:25:24,413 WARN L233 SmtUtils]: Spent 28.24s on a formula simplification that was a NOOP. DAG size: 296 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:26:22,483 WARN L233 SmtUtils]: Spent 58.07s on a formula simplification. DAG size of input: 323 DAG size of output: 314 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:26:47,176 WARN L233 SmtUtils]: Spent 24.67s on a formula simplification that was a NOOP. DAG size: 295 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:26:47,697 INFO L134 LiptonReduction]: Checked pairs total: 11020 [2022-11-25 22:26:47,697 INFO L136 LiptonReduction]: Total number of compositions: 238 [2022-11-25 22:26:47,706 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 64 transitions, 133 flow [2022-11-25 22:26:47,761 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 436 states, 285 states have (on average 2.831578947368421) internal successors, (807), 435 states have internal predecessors, (807), 0 states have call successors, (0), 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-25 22:26:47,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:26:47,782 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;@7134bcb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:26:47,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-25 22:26:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 285 states have (on average 2.831578947368421) internal successors, (807), 435 states have internal predecessors, (807), 0 states have call successors, (0), 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-25 22:26:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 22:26:47,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:47,791 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 22:26:47,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 639, now seen corresponding path program 1 times [2022-11-25 22:26:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:47,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87144236] [2022-11-25 22:26:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:47,910 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-25 22:26:47,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87144236] [2022-11-25 22:26:47,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87144236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:47,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:47,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 22:26:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302561500] [2022-11-25 22:26:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:47,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:26:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:47,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:26:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:26:47,948 INFO L87 Difference]: Start difference. First operand has 436 states, 285 states have (on average 2.831578947368421) internal successors, (807), 435 states have internal predecessors, (807), 0 states have call successors, (0), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-25 22:26:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:48,195 INFO L93 Difference]: Finished difference Result 378 states and 715 transitions. [2022-11-25 22:26:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:26:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-25 22:26:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:48,210 INFO L225 Difference]: With dead ends: 378 [2022-11-25 22:26:48,210 INFO L226 Difference]: Without dead ends: 378 [2022-11-25 22:26:48,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-25 22:26:48,215 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:48,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:26:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-25 22:26:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-25 22:26:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 269 states have (on average 2.657992565055762) internal successors, (715), 377 states have internal predecessors, (715), 0 states have call successors, (0), 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-25 22:26:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 715 transitions. [2022-11-25 22:26:48,275 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 715 transitions. Word has length 1 [2022-11-25 22:26:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:48,276 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 715 transitions. [2022-11-25 22:26:48,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-25 22:26:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 715 transitions. [2022-11-25 22:26:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:26:48,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:48,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:26:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:26:48,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 631261, now seen corresponding path program 1 times [2022-11-25 22:26:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539576481] [2022-11-25 22:26:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:48,995 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-25 22:26:48,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:48,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539576481] [2022-11-25 22:26:48,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539576481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:48,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:48,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537136532] [2022-11-25 22:26:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:48,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:48,999 INFO L87 Difference]: Start difference. First operand 378 states and 715 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:49,335 INFO L93 Difference]: Finished difference Result 340 states and 641 transitions. [2022-11-25 22:26:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 22:26:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:49,339 INFO L225 Difference]: With dead ends: 340 [2022-11-25 22:26:49,339 INFO L226 Difference]: Without dead ends: 340 [2022-11-25 22:26:49,339 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-25 22:26:49,340 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:49,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:26:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-25 22:26:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-11-25 22:26:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 251 states have (on average 2.553784860557769) internal successors, (641), 339 states have internal predecessors, (641), 0 states have call successors, (0), 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-25 22:26:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 641 transitions. [2022-11-25 22:26:49,374 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 641 transitions. Word has length 3 [2022-11-25 22:26:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:49,375 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 641 transitions. [2022-11-25 22:26:49,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 641 transitions. [2022-11-25 22:26:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:26:49,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:49,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:26:49,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:26:49,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 631263, now seen corresponding path program 1 times [2022-11-25 22:26:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:49,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452956250] [2022-11-25 22:26:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:26:50,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452956250] [2022-11-25 22:26:50,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452956250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:50,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:50,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979189606] [2022-11-25 22:26:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:50,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:50,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:50,953 INFO L87 Difference]: Start difference. First operand 340 states and 641 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:51,168 INFO L93 Difference]: Finished difference Result 316 states and 594 transitions. [2022-11-25 22:26:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:51,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 22:26:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:51,173 INFO L225 Difference]: With dead ends: 316 [2022-11-25 22:26:51,173 INFO L226 Difference]: Without dead ends: 316 [2022-11-25 22:26:51,173 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-25 22:26:51,174 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:51,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:26:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-25 22:26:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-11-25 22:26:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 239 states have (on average 2.485355648535565) internal successors, (594), 315 states have internal predecessors, (594), 0 states have call successors, (0), 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-25 22:26:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 594 transitions. [2022-11-25 22:26:51,203 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 594 transitions. Word has length 3 [2022-11-25 22:26:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:51,204 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 594 transitions. [2022-11-25 22:26:51,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 594 transitions. [2022-11-25 22:26:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:26:51,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:51,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:26:51,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:26:51,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 631267, now seen corresponding path program 1 times [2022-11-25 22:26:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133596277] [2022-11-25 22:26:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:51,641 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-25 22:26:51,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133596277] [2022-11-25 22:26:51,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133596277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:51,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434533742] [2022-11-25 22:26:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:51,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:51,645 INFO L87 Difference]: Start difference. First operand 316 states and 594 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:51,913 INFO L93 Difference]: Finished difference Result 314 states and 556 transitions. [2022-11-25 22:26:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 22:26:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:51,915 INFO L225 Difference]: With dead ends: 314 [2022-11-25 22:26:51,916 INFO L226 Difference]: Without dead ends: 314 [2022-11-25 22:26:51,916 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-25 22:26:51,917 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:51,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:26:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-25 22:26:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 284. [2022-11-25 22:26:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 216 states have (on average 2.4537037037037037) internal successors, (530), 283 states have internal predecessors, (530), 0 states have call successors, (0), 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-25 22:26:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 530 transitions. [2022-11-25 22:26:51,927 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 530 transitions. Word has length 3 [2022-11-25 22:26:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:51,927 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 530 transitions. [2022-11-25 22:26:51,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 530 transitions. [2022-11-25 22:26:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:26:51,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:51,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:26:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:26:51,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash 19569479, now seen corresponding path program 1 times [2022-11-25 22:26:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:51,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340693728] [2022-11-25 22:26:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:51,994 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-25 22:26:51,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:51,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340693728] [2022-11-25 22:26:51,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340693728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:51,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:51,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:26:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072928903] [2022-11-25 22:26:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:51,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:51,997 INFO L87 Difference]: Start difference. First operand 284 states and 530 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:52,382 INFO L93 Difference]: Finished difference Result 273 states and 505 transitions. [2022-11-25 22:26:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-25 22:26:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:52,385 INFO L225 Difference]: With dead ends: 273 [2022-11-25 22:26:52,385 INFO L226 Difference]: Without dead ends: 273 [2022-11-25 22:26:52,385 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-25 22:26:52,386 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:52,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:26:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-25 22:26:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-11-25 22:26:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 210 states have (on average 2.4047619047619047) internal successors, (505), 272 states have internal predecessors, (505), 0 states have call successors, (0), 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-25 22:26:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 505 transitions. [2022-11-25 22:26:52,401 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 505 transitions. Word has length 4 [2022-11-25 22:26:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:52,401 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 505 transitions. [2022-11-25 22:26:52,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 505 transitions. [2022-11-25 22:26:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:26:52,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:52,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:26:52,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:26:52,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 19567659, now seen corresponding path program 1 times [2022-11-25 22:26:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:52,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272887388] [2022-11-25 22:26:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:53,142 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-25 22:26:53,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272887388] [2022-11-25 22:26:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272887388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:53,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:53,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599191605] [2022-11-25 22:26:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:53,145 INFO L87 Difference]: Start difference. First operand 273 states and 505 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:53,440 INFO L93 Difference]: Finished difference Result 268 states and 495 transitions. [2022-11-25 22:26:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-25 22:26:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:53,443 INFO L225 Difference]: With dead ends: 268 [2022-11-25 22:26:53,443 INFO L226 Difference]: Without dead ends: 268 [2022-11-25 22:26:53,443 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-25 22:26:53,444 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:53,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:26:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-25 22:26:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-25 22:26:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 207 states have (on average 2.391304347826087) internal successors, (495), 267 states have internal predecessors, (495), 0 states have call successors, (0), 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-25 22:26:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 495 transitions. [2022-11-25 22:26:53,453 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 495 transitions. Word has length 4 [2022-11-25 22:26:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:53,453 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 495 transitions. [2022-11-25 22:26:53,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 495 transitions. [2022-11-25 22:26:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:26:53,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:53,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:26:53,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:26:53,455 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 19569537, now seen corresponding path program 1 times [2022-11-25 22:26:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:53,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594026409] [2022-11-25 22:26:53,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:54,234 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-25 22:26:54,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:54,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594026409] [2022-11-25 22:26:54,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594026409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:54,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:54,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:26:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863700651] [2022-11-25 22:26:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:26:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:26:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:26:54,237 INFO L87 Difference]: Start difference. First operand 268 states and 495 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:54,748 INFO L93 Difference]: Finished difference Result 256 states and 470 transitions. [2022-11-25 22:26:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:26:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-25 22:26:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:54,750 INFO L225 Difference]: With dead ends: 256 [2022-11-25 22:26:54,750 INFO L226 Difference]: Without dead ends: 256 [2022-11-25 22:26:54,750 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-25 22:26:54,751 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:54,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:26:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-25 22:26:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-25 22:26:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 195 states have (on average 2.41025641025641) internal successors, (470), 255 states have internal predecessors, (470), 0 states have call successors, (0), 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-25 22:26:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 470 transitions. [2022-11-25 22:26:54,759 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 470 transitions. Word has length 4 [2022-11-25 22:26:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:54,760 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 470 transitions. [2022-11-25 22:26:54,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 22:26:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 470 transitions. [2022-11-25 22:26:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:26:54,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:54,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:26:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:26:54,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1626518556, now seen corresponding path program 1 times [2022-11-25 22:26:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:54,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165537403] [2022-11-25 22:26:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:54,951 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-25 22:26:54,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165537403] [2022-11-25 22:26:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165537403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:54,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:54,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657841620] [2022-11-25 22:26:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:54,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:54,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:54,954 INFO L87 Difference]: Start difference. First operand 256 states and 470 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:55,156 INFO L93 Difference]: Finished difference Result 225 states and 410 transitions. [2022-11-25 22:26:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 22:26:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:55,158 INFO L225 Difference]: With dead ends: 225 [2022-11-25 22:26:55,158 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 22:26:55,158 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-25 22:26:55,159 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:55,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:26:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 22:26:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-11-25 22:26:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 2.2905027932960893) internal successors, (410), 224 states have internal predecessors, (410), 0 states have call successors, (0), 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-25 22:26:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 410 transitions. [2022-11-25 22:26:55,183 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 410 transitions. Word has length 6 [2022-11-25 22:26:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:55,183 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 410 transitions. [2022-11-25 22:26:55,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 410 transitions. [2022-11-25 22:26:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:26:55,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:55,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:26:55,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:26:55,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1626518554, now seen corresponding path program 1 times [2022-11-25 22:26:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019892767] [2022-11-25 22:26:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:56,575 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-25 22:26:56,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019892767] [2022-11-25 22:26:56,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019892767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:56,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:56,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:26:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520302309] [2022-11-25 22:26:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:56,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:26:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:26:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:26:56,578 INFO L87 Difference]: Start difference. First operand 225 states and 410 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:57,130 INFO L93 Difference]: Finished difference Result 198 states and 357 transitions. [2022-11-25 22:26:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:26:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 22:26:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:57,132 INFO L225 Difference]: With dead ends: 198 [2022-11-25 22:26:57,132 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 22:26:57,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:26:57,133 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:57,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:26:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 22:26:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-25 22:26:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 164 states have (on average 2.176829268292683) internal successors, (357), 197 states have internal predecessors, (357), 0 states have call successors, (0), 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-25 22:26:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 357 transitions. [2022-11-25 22:26:57,140 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 357 transitions. Word has length 6 [2022-11-25 22:26:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:57,140 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 357 transitions. [2022-11-25 22:26:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 357 transitions. [2022-11-25 22:26:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:26:57,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:57,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:26:57,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:26:57,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1626519075, now seen corresponding path program 1 times [2022-11-25 22:26:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:57,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262895272] [2022-11-25 22:26:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:57,242 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-25 22:26:57,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:57,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262895272] [2022-11-25 22:26:57,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262895272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:57,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:57,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:26:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152237694] [2022-11-25 22:26:57,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:57,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:57,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:57,245 INFO L87 Difference]: Start difference. First operand 198 states and 357 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:57,656 INFO L93 Difference]: Finished difference Result 207 states and 347 transitions. [2022-11-25 22:26:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 22:26:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:57,658 INFO L225 Difference]: With dead ends: 207 [2022-11-25 22:26:57,658 INFO L226 Difference]: Without dead ends: 205 [2022-11-25 22:26:57,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:57,659 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:57,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:26:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-25 22:26:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2022-11-25 22:26:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 2.1621621621621623) internal successors, (320), 181 states have internal predecessors, (320), 0 states have call successors, (0), 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-25 22:26:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 320 transitions. [2022-11-25 22:26:57,665 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 320 transitions. Word has length 6 [2022-11-25 22:26:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:57,665 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 320 transitions. [2022-11-25 22:26:57,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:26:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 320 transitions. [2022-11-25 22:26:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:26:57,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:57,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:26:57,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:26:57,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1117531978, now seen corresponding path program 1 times [2022-11-25 22:26:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824485069] [2022-11-25 22:26:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:58,553 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-25 22:26:58,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:58,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824485069] [2022-11-25 22:26:58,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824485069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:58,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:58,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:26:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105378795] [2022-11-25 22:26:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:58,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:26:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:26:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:26:58,556 INFO L87 Difference]: Start difference. First operand 182 states and 320 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:26:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:59,439 INFO L93 Difference]: Finished difference Result 158 states and 258 transitions. [2022-11-25 22:26:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:26:59,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:26:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:59,442 INFO L225 Difference]: With dead ends: 158 [2022-11-25 22:26:59,442 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 22:26:59,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:26:59,443 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:59,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 14 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:26:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 22:26:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2022-11-25 22:26:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 2.032520325203252) internal successors, (250), 148 states have internal predecessors, (250), 0 states have call successors, (0), 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-25 22:26:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 250 transitions. [2022-11-25 22:26:59,448 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 250 transitions. Word has length 7 [2022-11-25 22:26:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:59,448 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 250 transitions. [2022-11-25 22:26:59,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:26:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 250 transitions. [2022-11-25 22:26:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:26:59,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:59,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:26:59,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:26:59,449 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1117534926, now seen corresponding path program 1 times [2022-11-25 22:26:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:59,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675281037] [2022-11-25 22:26:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:26:59,554 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-25 22:26:59,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:26:59,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675281037] [2022-11-25 22:26:59,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675281037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:26:59,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:26:59,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:26:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180757970] [2022-11-25 22:26:59,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:26:59,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:26:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:26:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:26:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:26:59,557 INFO L87 Difference]: Start difference. First operand 149 states and 250 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:26:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:26:59,733 INFO L93 Difference]: Finished difference Result 133 states and 209 transitions. [2022-11-25 22:26:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:26:59,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:26:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:26:59,734 INFO L225 Difference]: With dead ends: 133 [2022-11-25 22:26:59,734 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 22:26:59,734 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-25 22:26:59,735 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:26:59,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:26:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 22:26:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2022-11-25 22:26:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.9433962264150944) internal successors, (206), 126 states have internal predecessors, (206), 0 states have call successors, (0), 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-25 22:26:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 206 transitions. [2022-11-25 22:26:59,739 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 206 transitions. Word has length 7 [2022-11-25 22:26:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:26:59,739 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 206 transitions. [2022-11-25 22:26:59,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:26:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 206 transitions. [2022-11-25 22:26:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:26:59,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:26:59,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:26:59,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:26:59,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:26:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:26:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1117532571, now seen corresponding path program 1 times [2022-11-25 22:26:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:26:59,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190213890] [2022-11-25 22:26:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:26:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:26:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:00,646 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-25 22:27:00,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:00,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190213890] [2022-11-25 22:27:00,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190213890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:00,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:00,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007734285] [2022-11-25 22:27:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:27:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:27:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:27:00,648 INFO L87 Difference]: Start difference. First operand 127 states and 206 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:27:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:01,052 INFO L93 Difference]: Finished difference Result 125 states and 199 transitions. [2022-11-25 22:27:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:27:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:27:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:01,054 INFO L225 Difference]: With dead ends: 125 [2022-11-25 22:27:01,054 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 22:27:01,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:27:01,055 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:01,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:27:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 22:27:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-11-25 22:27:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 122 states have internal predecessors, (198), 0 states have call successors, (0), 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-25 22:27:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 198 transitions. [2022-11-25 22:27:01,059 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 198 transitions. Word has length 7 [2022-11-25 22:27:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:01,059 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 198 transitions. [2022-11-25 22:27:01,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:27:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 198 transitions. [2022-11-25 22:27:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:27:01,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:01,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 22:27:01,060 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:27:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1117532570, now seen corresponding path program 1 times [2022-11-25 22:27:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325360867] [2022-11-25 22:27:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:01,827 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-25 22:27:01,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:01,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325360867] [2022-11-25 22:27:01,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325360867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:01,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:01,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414244454] [2022-11-25 22:27:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:01,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:27:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:01,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:27:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:27:01,830 INFO L87 Difference]: Start difference. First operand 123 states and 198 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:27:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:02,322 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2022-11-25 22:27:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:27:02,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:27:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:02,324 INFO L225 Difference]: With dead ends: 145 [2022-11-25 22:27:02,324 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 22:27:02,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:27:02,325 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:02,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:27:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 22:27:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2022-11-25 22:27:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.8627450980392157) internal successors, (190), 118 states have internal predecessors, (190), 0 states have call successors, (0), 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-25 22:27:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2022-11-25 22:27:02,330 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 7 [2022-11-25 22:27:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:02,330 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2022-11-25 22:27:02,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 22:27:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2022-11-25 22:27:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:27:02,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:02,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:02,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 22:27:02,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:27:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -206190857, now seen corresponding path program 1 times [2022-11-25 22:27:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:02,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296411495] [2022-11-25 22:27:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:03,707 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-25 22:27:03,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:03,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296411495] [2022-11-25 22:27:03,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296411495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:27:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130320762] [2022-11-25 22:27:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:03,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:27:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:27:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:27:03,708 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:04,647 INFO L93 Difference]: Finished difference Result 117 states and 187 transitions. [2022-11-25 22:27:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:27:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 22:27:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:04,649 INFO L225 Difference]: With dead ends: 117 [2022-11-25 22:27:04,649 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 22:27:04,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:27:04,650 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:04,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 22:27:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 22:27:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-25 22:27:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.8514851485148516) internal successors, (187), 116 states have internal predecessors, (187), 0 states have call successors, (0), 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-25 22:27:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 187 transitions. [2022-11-25 22:27:04,654 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 187 transitions. Word has length 9 [2022-11-25 22:27:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:04,655 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 187 transitions. [2022-11-25 22:27:04,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 187 transitions. [2022-11-25 22:27:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:27:04,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:04,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:04,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 22:27:04,656 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:27:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -206190856, now seen corresponding path program 1 times [2022-11-25 22:27:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:04,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712637818] [2022-11-25 22:27:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:05,584 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-25 22:27:05,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:05,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712637818] [2022-11-25 22:27:05,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712637818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:05,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:05,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:27:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364535244] [2022-11-25 22:27:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:05,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:27:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:27:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:27:05,586 INFO L87 Difference]: Start difference. First operand 117 states and 187 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:06,138 INFO L93 Difference]: Finished difference Result 143 states and 209 transitions. [2022-11-25 22:27:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:27:06,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 22:27:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:06,139 INFO L225 Difference]: With dead ends: 143 [2022-11-25 22:27:06,140 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 22:27:06,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:27:06,140 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:06,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 13 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:27:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 22:27:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2022-11-25 22:27:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.84) internal successors, (184), 114 states have internal predecessors, (184), 0 states have call successors, (0), 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-25 22:27:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2022-11-25 22:27:06,145 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 9 [2022-11-25 22:27:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:06,145 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2022-11-25 22:27:06,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2022-11-25 22:27:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:27:06,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:06,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 22:27:06,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-25 22:27:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1619892036, now seen corresponding path program 1 times [2022-11-25 22:27:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985152187] [2022-11-25 22:27:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:27:06,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 22:27:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:27:06,246 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 22:27:06,247 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 22:27:06,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-11-25 22:27:06,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-11-25 22:27:06,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-11-25 22:27:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-11-25 22:27:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-11-25 22:27:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-11-25 22:27:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-11-25 22:27:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-11-25 22:27:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-11-25 22:27:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-11-25 22:27:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-11-25 22:27:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-11-25 22:27:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-11-25 22:27:06,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-11-25 22:27:06,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-11-25 22:27:06,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-11-25 22:27:06,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-11-25 22:27:06,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-11-25 22:27:06,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-11-25 22:27:06,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-11-25 22:27:06,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-11-25 22:27:06,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-11-25 22:27:06,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-11-25 22:27:06,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-11-25 22:27:06,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-11-25 22:27:06,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-11-25 22:27:06,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-11-25 22:27:06,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-11-25 22:27:06,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-11-25 22:27:06,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-11-25 22:27:06,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-11-25 22:27:06,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 56 remaining) [2022-11-25 22:27:06,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 56 remaining) [2022-11-25 22:27:06,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-11-25 22:27:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-11-25 22:27:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-11-25 22:27:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-11-25 22:27:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-11-25 22:27:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-11-25 22:27:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-11-25 22:27:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-11-25 22:27:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-11-25 22:27:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-11-25 22:27:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-11-25 22:27:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-11-25 22:27:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-11-25 22:27:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-11-25 22:27:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-11-25 22:27:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-11-25 22:27:06,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-11-25 22:27:06,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-11-25 22:27:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 22:27:06,263 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:06,269 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 22:27:06,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:27:06,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:27:06 BasicIcfg [2022-11-25 22:27:06,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:27:06,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:27:06,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:27:06,298 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:27:06,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:18:17" (3/4) ... [2022-11-25 22:27:06,301 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 22:27:06,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:27:06,302 INFO L158 Benchmark]: Toolchain (without parser) took 530953.60ms. Allocated memory was 216.0MB in the beginning and 375.4MB in the end (delta: 159.4MB). Free memory was 168.4MB in the beginning and 205.6MB in the end (delta: -37.1MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,302 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:27:06,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 903.14ms. Allocated memory is still 216.0MB. Free memory was 168.3MB in the beginning and 129.9MB in the end (delta: 38.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 216.0MB. Free memory was 129.9MB in the beginning and 127.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,303 INFO L158 Benchmark]: Boogie Preprocessor took 39.36ms. Allocated memory is still 216.0MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,304 INFO L158 Benchmark]: RCFGBuilder took 861.43ms. Allocated memory is still 216.0MB. Free memory was 125.7MB in the beginning and 102.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,304 INFO L158 Benchmark]: TraceAbstraction took 529079.99ms. Allocated memory was 216.0MB in the beginning and 375.4MB in the end (delta: 159.4MB). Free memory was 101.4MB in the beginning and 206.6MB in the end (delta: -105.2MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,304 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 375.4MB. Free memory was 206.6MB in the beginning and 205.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:27:06,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 903.14ms. Allocated memory is still 216.0MB. Free memory was 168.3MB in the beginning and 129.9MB in the end (delta: 38.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 216.0MB. Free memory was 129.9MB in the beginning and 127.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.36ms. Allocated memory is still 216.0MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 861.43ms. Allocated memory is still 216.0MB. Free memory was 125.7MB in the beginning and 102.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 529079.99ms. Allocated memory was 216.0MB in the beginning and 375.4MB in the end (delta: 159.4MB). Free memory was 101.4MB in the beginning and 206.6MB in the end (delta: -105.2MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 375.4MB. Free memory was 206.6MB in the beginning and 205.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 510.2s, 175 PlacesBefore, 68 PlacesAfterwards, 171 TransitionsBefore, 64 TransitionsAfterwards, 2590 CoEnabledTransitionPairs, 8 FixpointIterations, 168 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 238 TotalNumberOfCompositions, 11020 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4358, independent: 3920, independent conditional: 0, independent unconditional: 3920, dependent: 438, dependent conditional: 0, dependent unconditional: 438, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1928, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1928, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 144, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4358, independent: 2070, independent conditional: 0, independent unconditional: 2070, dependent: 360, dependent conditional: 0, dependent unconditional: 360, unknown: 1928, unknown conditional: 0, unknown unconditional: 1928] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-4:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-4:0}, t1={13:0}] [L1263] 0 return 0; VAL [\result=0, A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-4:0}, t1={13:0}] [L1263] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 528.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 510.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 88 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 123 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 22:27:06,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- 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-25 22:27:08,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:27:08,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:27:08,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:27:08,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:27:08,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:27:08,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:27:08,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:27:08,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:27:08,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:27:08,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:27:08,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:27:08,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:27:08,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:27:08,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:27:08,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:27:08,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:27:08,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:27:08,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:27:08,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:27:08,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:27:08,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:27:08,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:27:08,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:27:08,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:27:08,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:27:08,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:27:08,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:27:08,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:27:08,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:27:08,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:27:08,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:27:08,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:27:08,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:27:08,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:27:08,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:27:08,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:27:08,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:27:08,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:27:08,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:27:08,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:27:08,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:27:09,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:27:09,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:27:09,023 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:27:09,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:27:09,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:27:09,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:27:09,025 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:27:09,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:27:09,026 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:27:09,026 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:27:09,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:27:09,028 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:27:09,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:27:09,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:27:09,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:27:09,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:27:09,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:27:09,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:27:09,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:27:09,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:27:09,031 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:27:09,031 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:27:09,032 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:27:09,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:27:09,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:27:09,033 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:27:09,033 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:27:09,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:27:09,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:27:09,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:27:09,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:27:09,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:27:09,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:09,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:27:09,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:27:09,036 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:27:09,036 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:27:09,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:27:09,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:27:09,037 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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_24a8d296-d6ec-4079-a295-4a97bf6c3edd/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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2022-11-25 22:27:09,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:27:09,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:27:09,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:27:09,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:27:09,442 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:27:09,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2022-11-25 22:27:12,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:27:13,227 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:27:13,228 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2022-11-25 22:27:13,259 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/5bc8767eb/e066c030eab042ce8c4c632486b90c58/FLAG7d4e50154 [2022-11-25 22:27:13,280 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/data/5bc8767eb/e066c030eab042ce8c4c632486b90c58 [2022-11-25 22:27:13,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:27:13,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:27:13,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:13,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:27:13,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:27:13,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:13" (1/1) ... [2022-11-25 22:27:13,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d65718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:13, skipping insertion in model container [2022-11-25 22:27:13,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:13" (1/1) ... [2022-11-25 22:27:13,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:27:13,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:14,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:14,172 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:27:14,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:14,346 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:27:14,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14 WrapperNode [2022-11-25 22:27:14,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:14,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:14,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:27:14,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:27:14,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,425 INFO L138 Inliner]: procedures = 369, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 87 [2022-11-25 22:27:14,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:14,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:27:14,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:27:14,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:27:14,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,457 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:27:14,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:27:14,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:27:14,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:27:14,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (1/1) ... [2022-11-25 22:27:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:14,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:27:14,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24a8d296-d6ec-4079-a295-4a97bf6c3edd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:27:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:27:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:27:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:27:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:27:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:27:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 22:27:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 22:27:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:27:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:27:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:27:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 22:27:14,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 22:27:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:27:14,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:27:14,562 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 22:27:14,761 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:27:14,763 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:27:15,465 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:27:15,475 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:27:15,476 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:27:15,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:15 BoogieIcfgContainer [2022-11-25 22:27:15,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:27:15,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:27:15,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:27:15,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:27:15,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:27:13" (1/3) ... [2022-11-25 22:27:15,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2d5c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:15, skipping insertion in model container [2022-11-25 22:27:15,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:14" (2/3) ... [2022-11-25 22:27:15,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2d5c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:15, skipping insertion in model container [2022-11-25 22:27:15,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:15" (3/3) ... [2022-11-25 22:27:15,493 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2022-11-25 22:27:15,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:27:15,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-25 22:27:15,513 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 22:27:15,640 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 22:27:15,683 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 22:27:15,706 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 172 transitions, 349 flow [2022-11-25 22:27:15,712 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 172 transitions, 349 flow [2022-11-25 22:27:15,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 172 transitions, 349 flow [2022-11-25 22:27:15,842 INFO L130 PetriNetUnfolder]: 0/171 cut-off events. [2022-11-25 22:27:15,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 22:27:15,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 171 events. 0/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-11-25 22:27:15,851 INFO L119 LiptonReduction]: Number of co-enabled transitions 2590 [2022-11-25 22:28:27,383 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:28:33,375 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:28:38,401 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:28:48,537 WARN L233 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:28:54,220 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:28:59,388 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:29:04,716 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:29:30,852 WARN L233 SmtUtils]: Spent 20.80s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:29:48,310 WARN L233 SmtUtils]: Spent 17.46s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:30:13,197 WARN L233 SmtUtils]: Spent 24.89s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:30:35,769 WARN L233 SmtUtils]: Spent 22.57s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:30:59,625 WARN L233 SmtUtils]: Spent 20.94s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:31:07,567 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:31:29,149 WARN L233 SmtUtils]: Spent 21.58s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:31:35,827 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:32:09,426 WARN L233 SmtUtils]: Spent 25.89s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:32:25,718 WARN L233 SmtUtils]: Spent 16.29s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 22:32:50,656 WARN L233 SmtUtils]: Spent 24.94s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)