./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh --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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- 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-2329fc7 [2022-12-14 04:41:05,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:41:05,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:41:05,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:41:05,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:41:05,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:41:05,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:41:05,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:41:05,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:41:05,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:41:05,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:41:05,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:41:05,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:41:05,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:41:05,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:41:05,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:41:05,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:41:05,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:41:05,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:41:05,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:41:05,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:41:05,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:41:05,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:41:05,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:41:05,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:41:05,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:41:05,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:41:05,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:41:05,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:41:05,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:41:05,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:41:05,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:41:05,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:41:05,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:41:05,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:41:05,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:41:05,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:41:05,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:41:05,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:41:05,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:41:05,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:41:05,258 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 04:41:05,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:41:05,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:41:05,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:41:05,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:41:05,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:41:05,275 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:41:05,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:41:05,276 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:41:05,276 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:41:05,276 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:41:05,276 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:41:05,276 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:41:05,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:41:05,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:41:05,277 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:41:05,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:41:05,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:41:05,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:41:05,279 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:41:05,279 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_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/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_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2022-12-14 04:41:05,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:41:05,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:41:05,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:41:05,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:41:05,466 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:41:05,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2022-12-14 04:41:07,971 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:41:08,167 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:41:08,167 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2022-12-14 04:41:08,177 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/data/906098238/b4447d4369ed4ddcaeb1a89fdeea40ca/FLAGd28d7113e [2022-12-14 04:41:08,188 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/data/906098238/b4447d4369ed4ddcaeb1a89fdeea40ca [2022-12-14 04:41:08,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:41:08,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:41:08,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:41:08,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:41:08,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:41:08,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08, skipping insertion in model container [2022-12-14 04:41:08,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:41:08,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:41:08,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:41:08,731 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:41:08,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:41:08,811 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:41:08,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08 WrapperNode [2022-12-14 04:41:08,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:41:08,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:41:08,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:41:08,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:41:08,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,849 INFO L138 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 111 [2022-12-14 04:41:08,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:41:08,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:41:08,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:41:08,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:41:08,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,869 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:41:08,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:41:08,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:41:08,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:41:08,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (1/1) ... [2022-12-14 04:41:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:41:08,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:41:08,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:41:08,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 04:41:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-14 04:41:08,929 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:41:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:41:08,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:41:08,931 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 04:41:09,050 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:41:09,051 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:41:09,334 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:41:09,342 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:41:09,343 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 04:41:09,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:41:09 BoogieIcfgContainer [2022-12-14 04:41:09,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:41:09,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:41:09,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:41:09,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:41:09,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:41:08" (1/3) ... [2022-12-14 04:41:09,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1aa31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:41:09, skipping insertion in model container [2022-12-14 04:41:09,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:41:08" (2/3) ... [2022-12-14 04:41:09,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1aa31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:41:09, skipping insertion in model container [2022-12-14 04:41:09,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:41:09" (3/3) ... [2022-12-14 04:41:09,355 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2022-12-14 04:41:09,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:41:09,374 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-12-14 04:41:09,374 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:41:09,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 04:41:09,477 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:41:09,490 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 183 transitions, 371 flow [2022-12-14 04:41:09,493 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 183 transitions, 371 flow [2022-12-14 04:41:09,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 183 transitions, 371 flow [2022-12-14 04:41:09,544 INFO L130 PetriNetUnfolder]: 2/182 cut-off events. [2022-12-14 04:41:09,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 04:41:09,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 182 events. 2/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-14 04:41:09,552 INFO L119 LiptonReduction]: Number of co-enabled transitions 3136 [2022-12-14 04:41:52,849 WARN L233 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 219 DAG size of output: 209 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:42:03,714 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 222 DAG size of output: 212 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:42:18,278 WARN L233 SmtUtils]: Spent 11.19s on a formula simplification. DAG size of input: 238 DAG size of output: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:42:40,771 WARN L233 SmtUtils]: Spent 18.23s on a formula simplification. DAG size of input: 241 DAG size of output: 231 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:42:47,739 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:42:55,426 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 224 DAG size of output: 214 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:43:07,673 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 227 DAG size of output: 217 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:43:18,707 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 223 DAG size of output: 220 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:43:33,752 WARN L233 SmtUtils]: Spent 11.42s on a formula simplification. DAG size of input: 235 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:43:39,191 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:44:00,708 WARN L233 SmtUtils]: Spent 21.48s on a formula simplification. DAG size of input: 276 DAG size of output: 263 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:44:11,022 WARN L233 SmtUtils]: Spent 10.31s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:44:36,449 WARN L233 SmtUtils]: Spent 25.42s on a formula simplification. DAG size of input: 282 DAG size of output: 269 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:44:48,876 WARN L233 SmtUtils]: Spent 12.42s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 04:44:48,894 INFO L134 LiptonReduction]: Checked pairs total: 12095 [2022-12-14 04:44:48,894 INFO L136 LiptonReduction]: Total number of compositions: 280 [2022-12-14 04:44:48,900 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 58 transitions, 121 flow [2022-12-14 04:44:48,921 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 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-12-14 04:44:48,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:44:48,937 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;@784bca39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:44:48,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-12-14 04:44:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 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-12-14 04:44:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 04:44:48,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:48,943 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 04:44:48,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 735, now seen corresponding path program 1 times [2022-12-14 04:44:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:48,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151611658] [2022-12-14 04:44:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:49,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:49,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151611658] [2022-12-14 04:44:49,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151611658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:49,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:49,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 04:44:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939665007] [2022-12-14 04:44:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 04:44:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 04:44:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 04:44:49,081 INFO L87 Difference]: Start difference. First operand has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 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-12-14 04:44:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:49,198 INFO L93 Difference]: Finished difference Result 298 states and 559 transitions. [2022-12-14 04:44:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 04:44:49,201 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-12-14 04:44:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:49,208 INFO L225 Difference]: With dead ends: 298 [2022-12-14 04:44:49,209 INFO L226 Difference]: Without dead ends: 298 [2022-12-14 04:44:49,209 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-12-14 04:44:49,212 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:49,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-14 04:44:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-12-14 04:44:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 211 states have (on average 2.6492890995260665) internal successors, (559), 297 states have internal predecessors, (559), 0 states have call successors, (0), 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-12-14 04:44:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 559 transitions. [2022-12-14 04:44:49,259 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 559 transitions. Word has length 1 [2022-12-14 04:44:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:49,259 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 559 transitions. [2022-12-14 04:44:49,259 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-12-14 04:44:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 559 transitions. [2022-12-14 04:44:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 04:44:49,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:49,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 04:44:49,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:44:49,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:49,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 728114, now seen corresponding path program 1 times [2022-12-14 04:44:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:49,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107371522] [2022-12-14 04:44:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:50,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:50,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107371522] [2022-12-14 04:44:50,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107371522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:50,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:50,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:44:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6007283] [2022-12-14 04:44:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:50,197 INFO L87 Difference]: Start difference. First operand 298 states and 559 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-12-14 04:44:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:50,371 INFO L93 Difference]: Finished difference Result 304 states and 550 transitions. [2022-12-14 04:44:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:50,372 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-12-14 04:44:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:50,374 INFO L225 Difference]: With dead ends: 304 [2022-12-14 04:44:50,374 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 04:44:50,374 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-12-14 04:44:50,375 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:50,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:44:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 04:44:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2022-12-14 04:44:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 2.6041666666666665) internal successors, (500), 267 states have internal predecessors, (500), 0 states have call successors, (0), 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-12-14 04:44:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 500 transitions. [2022-12-14 04:44:50,390 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 500 transitions. Word has length 3 [2022-12-14 04:44:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:50,391 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 500 transitions. [2022-12-14 04:44:50,391 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-12-14 04:44:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 500 transitions. [2022-12-14 04:44:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:44:50,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:50,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:44:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:44:50,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 22572013, now seen corresponding path program 1 times [2022-12-14 04:44:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185750294] [2022-12-14 04:44:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:50,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:50,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185750294] [2022-12-14 04:44:50,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185750294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:50,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:50,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:44:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021066349] [2022-12-14 04:44:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:50,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:50,702 INFO L87 Difference]: Start difference. First operand 268 states and 500 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-12-14 04:44:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:50,809 INFO L93 Difference]: Finished difference Result 266 states and 496 transitions. [2022-12-14 04:44:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:50,810 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-12-14 04:44:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:50,811 INFO L225 Difference]: With dead ends: 266 [2022-12-14 04:44:50,811 INFO L226 Difference]: Without dead ends: 266 [2022-12-14 04:44:50,811 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-12-14 04:44:50,811 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:50,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-14 04:44:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-12-14 04:44:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 190 states have (on average 2.610526315789474) internal successors, (496), 265 states have internal predecessors, (496), 0 states have call successors, (0), 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-12-14 04:44:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 496 transitions. [2022-12-14 04:44:50,818 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 496 transitions. Word has length 4 [2022-12-14 04:44:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:50,818 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 496 transitions. [2022-12-14 04:44:50,818 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-12-14 04:44:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 496 transitions. [2022-12-14 04:44:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:44:50,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:50,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:44:50,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 04:44:50,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 22572130, now seen corresponding path program 1 times [2022-12-14 04:44:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:50,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977346392] [2022-12-14 04:44:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:51,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977346392] [2022-12-14 04:44:51,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977346392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:51,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:51,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:44:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471053109] [2022-12-14 04:44:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:51,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:51,580 INFO L87 Difference]: Start difference. First operand 266 states and 496 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-12-14 04:44:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:51,723 INFO L93 Difference]: Finished difference Result 262 states and 487 transitions. [2022-12-14 04:44:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:51,723 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-12-14 04:44:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:51,725 INFO L225 Difference]: With dead ends: 262 [2022-12-14 04:44:51,725 INFO L226 Difference]: Without dead ends: 262 [2022-12-14 04:44:51,725 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-12-14 04:44:51,726 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:51,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-12-14 04:44:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-12-14 04:44:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 2.6042780748663104) internal successors, (487), 261 states have internal predecessors, (487), 0 states have call successors, (0), 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-12-14 04:44:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 487 transitions. [2022-12-14 04:44:51,735 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 487 transitions. Word has length 4 [2022-12-14 04:44:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:51,735 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 487 transitions. [2022-12-14 04:44:51,735 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-12-14 04:44:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 487 transitions. [2022-12-14 04:44:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 04:44:51,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:51,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 04:44:51,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:44:51,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 699732943, now seen corresponding path program 1 times [2022-12-14 04:44:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:51,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536762469] [2022-12-14 04:44:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:52,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536762469] [2022-12-14 04:44:52,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536762469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:52,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:52,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:44:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850701266] [2022-12-14 04:44:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:52,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:44:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:44:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:44:52,653 INFO L87 Difference]: Start difference. First operand 262 states and 487 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:52,881 INFO L93 Difference]: Finished difference Result 258 states and 478 transitions. [2022-12-14 04:44:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:44:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 04:44:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:52,882 INFO L225 Difference]: With dead ends: 258 [2022-12-14 04:44:52,882 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 04:44:52,882 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-12-14 04:44:52,883 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:52,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:44:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 04:44:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-12-14 04:44:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 184 states have (on average 2.597826086956522) internal successors, (478), 257 states have internal predecessors, (478), 0 states have call successors, (0), 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-12-14 04:44:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 478 transitions. [2022-12-14 04:44:52,888 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 478 transitions. Word has length 5 [2022-12-14 04:44:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:52,888 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 478 transitions. [2022-12-14 04:44:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 478 transitions. [2022-12-14 04:44:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 04:44:52,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:52,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 04:44:52,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:44:52,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 699732706, now seen corresponding path program 1 times [2022-12-14 04:44:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:52,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676835555] [2022-12-14 04:44:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:53,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676835555] [2022-12-14 04:44:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676835555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:53,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:53,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:44:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085755323] [2022-12-14 04:44:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:53,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:44:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:44:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:44:53,630 INFO L87 Difference]: Start difference. First operand 258 states and 478 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:53,869 INFO L93 Difference]: Finished difference Result 269 states and 512 transitions. [2022-12-14 04:44:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:44:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 04:44:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:53,871 INFO L225 Difference]: With dead ends: 269 [2022-12-14 04:44:53,871 INFO L226 Difference]: Without dead ends: 269 [2022-12-14 04:44:53,871 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-12-14 04:44:53,871 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:53,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:44:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-14 04:44:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-12-14 04:44:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 196 states have (on average 2.6122448979591835) internal successors, (512), 268 states have internal predecessors, (512), 0 states have call successors, (0), 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-12-14 04:44:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 512 transitions. [2022-12-14 04:44:53,877 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 512 transitions. Word has length 5 [2022-12-14 04:44:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:53,877 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 512 transitions. [2022-12-14 04:44:53,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 512 transitions. [2022-12-14 04:44:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 04:44:53,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:53,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 04:44:53,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:44:53,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 699812138, now seen corresponding path program 1 times [2022-12-14 04:44:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:53,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521264831] [2022-12-14 04:44:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:53,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521264831] [2022-12-14 04:44:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521264831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:53,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:53,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:44:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694171028] [2022-12-14 04:44:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:53,934 INFO L87 Difference]: Start difference. First operand 269 states and 512 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:54,153 INFO L93 Difference]: Finished difference Result 311 states and 575 transitions. [2022-12-14 04:44:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 04:44:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:54,155 INFO L225 Difference]: With dead ends: 311 [2022-12-14 04:44:54,155 INFO L226 Difference]: Without dead ends: 311 [2022-12-14 04:44:54,155 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-12-14 04:44:54,156 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:54,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:44:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-12-14 04:44:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 259. [2022-12-14 04:44:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 193 states have (on average 2.6373056994818653) internal successors, (509), 258 states have internal predecessors, (509), 0 states have call successors, (0), 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-12-14 04:44:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 509 transitions. [2022-12-14 04:44:54,162 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 509 transitions. Word has length 5 [2022-12-14 04:44:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:54,163 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 509 transitions. [2022-12-14 04:44:54,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 509 transitions. [2022-12-14 04:44:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 04:44:54,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:54,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 04:44:54,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:44:54,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 699812171, now seen corresponding path program 1 times [2022-12-14 04:44:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802337619] [2022-12-14 04:44:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:54,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802337619] [2022-12-14 04:44:54,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802337619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:54,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:54,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:44:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269093983] [2022-12-14 04:44:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:54,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:54,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:54,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:54,247 INFO L87 Difference]: Start difference. First operand 259 states and 509 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:54,440 INFO L93 Difference]: Finished difference Result 244 states and 479 transitions. [2022-12-14 04:44:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 04:44:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:54,441 INFO L225 Difference]: With dead ends: 244 [2022-12-14 04:44:54,441 INFO L226 Difference]: Without dead ends: 244 [2022-12-14 04:44:54,441 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-12-14 04:44:54,442 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:54,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:44:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-12-14 04:44:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-12-14 04:44:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 185 states have (on average 2.5891891891891894) internal successors, (479), 243 states have internal predecessors, (479), 0 states have call successors, (0), 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-12-14 04:44:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2022-12-14 04:44:54,447 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 5 [2022-12-14 04:44:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:54,447 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2022-12-14 04:44:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:44:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2022-12-14 04:44:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 04:44:54,448 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:54,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 04:44:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 04:44:54,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 216883838, now seen corresponding path program 1 times [2022-12-14 04:44:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:54,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395398434] [2022-12-14 04:44:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:55,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395398434] [2022-12-14 04:44:55,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395398434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:55,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:55,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:44:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235279270] [2022-12-14 04:44:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:55,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:44:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:44:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:44:55,340 INFO L87 Difference]: Start difference. First operand 244 states and 479 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-12-14 04:44:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:55,687 INFO L93 Difference]: Finished difference Result 323 states and 616 transitions. [2022-12-14 04:44:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:44:55,688 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-12-14 04:44:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:55,689 INFO L225 Difference]: With dead ends: 323 [2022-12-14 04:44:55,689 INFO L226 Difference]: Without dead ends: 323 [2022-12-14 04:44:55,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:44:55,689 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:55,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 16 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:44:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-14 04:44:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 254. [2022-12-14 04:44:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 195 states have (on average 2.5538461538461537) internal successors, (498), 253 states have internal predecessors, (498), 0 states have call successors, (0), 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-12-14 04:44:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 498 transitions. [2022-12-14 04:44:55,694 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 498 transitions. Word has length 6 [2022-12-14 04:44:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:55,694 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 498 transitions. [2022-12-14 04:44:55,694 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-12-14 04:44:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 498 transitions. [2022-12-14 04:44:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 04:44:55,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:55,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 04:44:55,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 04:44:55,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 217084593, now seen corresponding path program 1 times [2022-12-14 04:44:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:55,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766967042] [2022-12-14 04:44:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:44:55,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766967042] [2022-12-14 04:44:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766967042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:55,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:44:55,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:44:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540349692] [2022-12-14 04:44:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:55,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:44:55,751 INFO L87 Difference]: Start difference. First operand 254 states and 498 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-12-14 04:44:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:55,893 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-12-14 04:44:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:55,893 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-12-14 04:44:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:55,894 INFO L225 Difference]: With dead ends: 125 [2022-12-14 04:44:55,894 INFO L226 Difference]: Without dead ends: 124 [2022-12-14 04:44:55,894 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-12-14 04:44:55,895 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:55,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-14 04:44:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-12-14 04:44:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 2.24468085106383) internal successors, (211), 123 states have internal predecessors, (211), 0 states have call successors, (0), 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-12-14 04:44:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 211 transitions. [2022-12-14 04:44:55,897 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 211 transitions. Word has length 6 [2022-12-14 04:44:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:55,897 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 211 transitions. [2022-12-14 04:44:55,897 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-12-14 04:44:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2022-12-14 04:44:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 04:44:55,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:55,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 04:44:55,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 04:44:55,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-14 04:44:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash 219341435, now seen corresponding path program 1 times [2022-12-14 04:44:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:55,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277606065] [2022-12-14 04:44:55,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:44:55,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 04:44:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:44:55,975 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 04:44:55,975 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 04:44:55,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2022-12-14 04:44:55,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2022-12-14 04:44:55,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2022-12-14 04:44:55,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2022-12-14 04:44:55,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2022-12-14 04:44:55,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2022-12-14 04:44:55,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2022-12-14 04:44:55,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2022-12-14 04:44:55,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 04:44:55,983 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:55,987 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 04:44:55,987 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 04:44:56,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:44:56 BasicIcfg [2022-12-14 04:44:56,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 04:44:56,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 04:44:56,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 04:44:56,010 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 04:44:56,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:41:09" (3/4) ... [2022-12-14 04:44:56,011 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 04:44:56,038 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 04:44:56,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 04:44:56,038 INFO L158 Benchmark]: Toolchain (without parser) took 227847.41ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 100.3MB in the beginning and 243.2MB in the end (delta: -142.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,038 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:44:56,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.16ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 61.5MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.17ms. Allocated memory is still 134.2MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,039 INFO L158 Benchmark]: Boogie Preprocessor took 21.60ms. Allocated memory is still 134.2MB. Free memory was 58.7MB in the beginning and 56.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,039 INFO L158 Benchmark]: RCFGBuilder took 473.07ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 119.6MB in the end (delta: -62.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,039 INFO L158 Benchmark]: TraceAbstraction took 226661.17ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 118.7MB in the beginning and 247.4MB in the end (delta: -128.7MB). Peak memory consumption was 158.4MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,040 INFO L158 Benchmark]: Witness Printer took 28.23ms. Allocated memory is still 293.6MB. Free memory was 247.4MB in the beginning and 243.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 04:44:56,041 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.17ms. Allocated memory is still 134.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.16ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 61.5MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.17ms. Allocated memory is still 134.2MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.60ms. Allocated memory is still 134.2MB. Free memory was 58.7MB in the beginning and 56.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.07ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 119.6MB in the end (delta: -62.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 226661.17ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 118.7MB in the beginning and 247.4MB in the end (delta: -128.7MB). Peak memory consumption was 158.4MB. Max. memory is 16.1GB. * Witness Printer took 28.23ms. Allocated memory is still 293.6MB. Free memory was 247.4MB in the beginning and 243.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.4s, 185 PlacesBefore, 62 PlacesAfterwards, 183 TransitionsBefore, 58 TransitionsAfterwards, 3136 CoEnabledTransitionPairs, 9 FixpointIterations, 186 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 280 TotalNumberOfCompositions, 12095 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5507, independent: 5004, independent conditional: 0, independent unconditional: 5004, dependent: 503, dependent conditional: 0, dependent unconditional: 503, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2306, independent: 2217, independent conditional: 0, independent unconditional: 2217, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2306, independent: 2140, independent conditional: 0, independent unconditional: 2140, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 166, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 304, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5507, independent: 2787, independent conditional: 0, independent unconditional: 2787, dependent: 414, dependent conditional: 0, dependent unconditional: 414, unknown: 2306, unknown conditional: 0, unknown unconditional: 2306] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 264, Positive conditional cache size: 0, Positive unconditional cache size: 264, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=8, mutex={1:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, slot={2:0}, t1={13:0}] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=3, \old(x)=2, \result={11:0}, malloc(sizeof(struct s))={-2:0}, mutex={1:0}, p={11:0}, p={-2:0}, slot={2:0}, x=2, x=3] [L1234] 1 p->datum = x VAL [\old(x)=2, \old(x)=3, \result={11:0}, mutex={1:0}, p={-2:0}, p={11:0}, slot={2:0}, x=3, x=2] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - 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: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 239 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 226.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 219.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 35 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 157 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 04:44:56,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c6e138c-9419-4ba2-ae43-bbf3223bd008/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)