./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test30-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test30-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 153e0ba078e70e495115e12774ba4ffa7f132da5fa3a0d4a5d0df94079ed38d6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:40:24,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:40:24,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:40:24,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:40:24,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:40:24,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:40:24,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:40:24,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:40:24,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:40:24,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:40:24,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:40:24,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:40:24,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:40:24,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:40:24,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:40:24,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:40:24,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:40:24,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:40:24,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:40:24,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:40:24,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:40:24,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:40:24,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:40:24,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:40:24,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:40:24,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:40:24,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:40:24,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:40:24,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:40:24,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:40:24,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:40:24,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:40:24,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:40:24,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:40:24,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:40:24,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:40:24,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:40:24,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:40:24,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:40:24,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:40:24,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:40:24,491 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:40:24,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:40:24,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:40:24,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:40:24,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:40:24,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:40:24,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:40:24,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:40:24,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:40:24,550 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:40:24,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:40:24,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:40:24,552 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:40:24,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:40:24,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:40:24,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:40:24,553 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:40:24,553 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:40:24,553 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:40:24,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:40:24,554 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:40:24,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:40:24,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:40:24,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:40:24,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:40:24,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:40:24,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:40:24,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:40:24,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:40:24,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:40:24,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:40:24,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:40:24,558 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:40:24,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:40:24,559 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/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_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer 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 -> 153e0ba078e70e495115e12774ba4ffa7f132da5fa3a0d4a5d0df94079ed38d6 [2022-11-25 15:40:24,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:40:24,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:40:24,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:40:24,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:40:24,951 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:40:24,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-regression/test30-1.c [2022-11-25 15:40:28,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:40:29,000 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:40:29,001 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/sv-benchmarks/c/ldv-regression/test30-1.c [2022-11-25 15:40:29,010 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/data/99f9f0e02/59aa46c3e24845cba6eb0674fac6b96e/FLAGc8903d73a [2022-11-25 15:40:29,033 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/data/99f9f0e02/59aa46c3e24845cba6eb0674fac6b96e [2022-11-25 15:40:29,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:40:29,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:40:29,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:40:29,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:40:29,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:40:29,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c90e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29, skipping insertion in model container [2022-11-25 15:40:29,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:40:29,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:40:29,253 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/sv-benchmarks/c/ldv-regression/test30-1.c[560,573] [2022-11-25 15:40:29,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:40:29,273 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:40:29,292 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/sv-benchmarks/c/ldv-regression/test30-1.c[560,573] [2022-11-25 15:40:29,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:40:29,311 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:40:29,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29 WrapperNode [2022-11-25 15:40:29,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:40:29,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:40:29,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:40:29,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:40:29,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,354 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2022-11-25 15:40:29,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:40:29,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:40:29,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:40:29,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:40:29,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:40:29,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:40:29,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:40:29,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:40:29,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (1/1) ... [2022-11-25 15:40:29,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:40:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:40:29,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:40:29,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:40:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:40:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 15:40:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:40:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:40:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:40:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:40:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:40:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:40:29,600 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:40:29,603 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:40:29,890 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:40:29,910 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:40:29,911 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:40:29,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:29 BoogieIcfgContainer [2022-11-25 15:40:29,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:40:29,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:40:29,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:40:29,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:40:29,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:40:29" (1/3) ... [2022-11-25 15:40:29,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9f28ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:40:29, skipping insertion in model container [2022-11-25 15:40:29,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:40:29" (2/3) ... [2022-11-25 15:40:29,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9f28ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:40:29, skipping insertion in model container [2022-11-25 15:40:29,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:29" (3/3) ... [2022-11-25 15:40:29,943 INFO L112 eAbstractionObserver]: Analyzing ICFG test30-1.c [2022-11-25 15:40:29,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:40:29,968 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 15:40:30,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:40:30,057 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=PETRI_NET, 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;@54e3c994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:40:30,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 15:40:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.9375) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:40:30,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:30,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:40:30,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 15:40:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345639616] [2022-11-25 15:40:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345639616] [2022-11-25 15:40:30,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345639616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:30,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:30,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701129824] [2022-11-25 15:40:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:30,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:30,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:30,637 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.9375) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:30,815 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-11-25 15:40:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:30,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 15:40:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:30,848 INFO L225 Difference]: With dead ends: 30 [2022-11-25 15:40:30,848 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 15:40:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:30,855 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:30,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:40:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 15:40:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 15:40:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.8) internal successors, (27), 27 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2022-11-25 15:40:30,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2022-11-25 15:40:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:30,892 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2022-11-25 15:40:30,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2022-11-25 15:40:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:40:30,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:30,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:40:30,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:40:30,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 15:40:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:30,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263191307] [2022-11-25 15:40:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263191307] [2022-11-25 15:40:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263191307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:31,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:31,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:31,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055793064] [2022-11-25 15:40:31,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:31,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:31,270 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:31,345 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-11-25 15:40:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 15:40:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:31,347 INFO L225 Difference]: With dead ends: 27 [2022-11-25 15:40:31,348 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 15:40:31,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:31,350 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:31,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 15:40:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 15:40:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2022-11-25 15:40:31,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 3 [2022-11-25 15:40:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:31,357 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2022-11-25 15:40:31,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-11-25 15:40:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:40:31,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:31,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:40:31,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:40:31,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-11-25 15:40:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:31,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735288386] [2022-11-25 15:40:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:31,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735288386] [2022-11-25 15:40:31,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735288386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:31,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:31,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:40:31,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899329941] [2022-11-25 15:40:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:31,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:31,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:31,440 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:31,488 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-11-25 15:40:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 15:40:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:31,490 INFO L225 Difference]: With dead ends: 26 [2022-11-25 15:40:31,490 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 15:40:31,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:31,493 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:31,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 15:40:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 15:40:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-11-25 15:40:31,499 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 4 [2022-11-25 15:40:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-11-25 15:40:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-11-25 15:40:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:40:31,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:31,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:40:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:40:31,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-11-25 15:40:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775382254] [2022-11-25 15:40:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:31,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775382254] [2022-11-25 15:40:31,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775382254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:31,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:31,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85782126] [2022-11-25 15:40:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:40:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:40:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:40:31,714 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:31,764 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-11-25 15:40:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:40:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 15:40:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:31,766 INFO L225 Difference]: With dead ends: 25 [2022-11-25 15:40:31,766 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 15:40:31,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:40:31,768 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:31,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 15:40:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 15:40:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.6) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2022-11-25 15:40:31,774 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 4 [2022-11-25 15:40:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:31,774 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2022-11-25 15:40:31,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2022-11-25 15:40:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:40:31,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:31,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:40:31,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:40:31,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-11-25 15:40:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387598867] [2022-11-25 15:40:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387598867] [2022-11-25 15:40:32,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387598867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:32,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:32,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920297894] [2022-11-25 15:40:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:32,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:32,027 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:32,220 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-11-25 15:40:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 15:40:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:32,223 INFO L225 Difference]: With dead ends: 24 [2022-11-25 15:40:32,223 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 15:40:32,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:32,233 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:32,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:40:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 15:40:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 15:40:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2022-11-25 15:40:32,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 6 [2022-11-25 15:40:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:32,238 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2022-11-25 15:40:32,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-11-25 15:40:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:40:32,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:32,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:40:32,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:40:32,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-11-25 15:40:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:32,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547044588] [2022-11-25 15:40:32,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:32,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:32,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547044588] [2022-11-25 15:40:32,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547044588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:32,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:32,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013964758] [2022-11-25 15:40:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:32,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:32,651 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:32,833 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-11-25 15:40:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 15:40:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:32,835 INFO L225 Difference]: With dead ends: 23 [2022-11-25 15:40:32,835 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 15:40:32,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:32,837 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:32,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:40:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 15:40:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 15:40:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2022-11-25 15:40:32,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 6 [2022-11-25 15:40:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:32,842 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2022-11-25 15:40:32,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-11-25 15:40:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 15:40:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:32,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:32,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:40:32,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026919, now seen corresponding path program 1 times [2022-11-25 15:40:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:32,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428853615] [2022-11-25 15:40:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:32,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428853615] [2022-11-25 15:40:32,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428853615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:32,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:32,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294497698] [2022-11-25 15:40:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:32,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:32,985 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,128 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-11-25 15:40:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:33,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 15:40:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,129 INFO L225 Difference]: With dead ends: 22 [2022-11-25 15:40:33,129 INFO L226 Difference]: Without dead ends: 22 [2022-11-25 15:40:33,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:33,131 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:40:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-25 15:40:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-25 15:40:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-11-25 15:40:33,135 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 7 [2022-11-25 15:40:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,135 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-11-25 15:40:33,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-11-25 15:40:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 15:40:33,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:40:33,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026920, now seen corresponding path program 1 times [2022-11-25 15:40:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:33,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001624370] [2022-11-25 15:40:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001624370] [2022-11-25 15:40:33,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001624370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:33,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:33,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:40:33,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984053505] [2022-11-25 15:40:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:33,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:33,341 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,483 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-25 15:40:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 15:40:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,484 INFO L225 Difference]: With dead ends: 21 [2022-11-25 15:40:33,484 INFO L226 Difference]: Without dead ends: 21 [2022-11-25 15:40:33,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:33,487 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 35 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-25 15:40:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 15:40:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-11-25 15:40:33,502 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 7 [2022-11-25 15:40:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,502 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-11-25 15:40:33,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-11-25 15:40:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:40:33,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:40:33,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 171977450, now seen corresponding path program 1 times [2022-11-25 15:40:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:33,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228280215] [2022-11-25 15:40:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:33,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228280215] [2022-11-25 15:40:33,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228280215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:33,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:33,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127821374] [2022-11-25 15:40:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:33,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,575 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,599 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-11-25 15:40:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 15:40:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,602 INFO L225 Difference]: With dead ends: 20 [2022-11-25 15:40:33,603 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 15:40:33,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,608 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 15:40:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-25 15:40:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-11-25 15:40:33,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 11 [2022-11-25 15:40:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,626 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-11-25 15:40:33,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-11-25 15:40:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:40:33,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:40:33,628 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 171977451, now seen corresponding path program 1 times [2022-11-25 15:40:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:33,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060631783] [2022-11-25 15:40:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:33,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060631783] [2022-11-25 15:40:33,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060631783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:33,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:33,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2867261] [2022-11-25 15:40:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,726 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,741 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-11-25 15:40:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 15:40:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,742 INFO L225 Difference]: With dead ends: 19 [2022-11-25 15:40:33,742 INFO L226 Difference]: Without dead ends: 19 [2022-11-25 15:40:33,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,744 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-25 15:40:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-25 15:40:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-11-25 15:40:33,748 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 11 [2022-11-25 15:40:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,748 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-11-25 15:40:33,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-11-25 15:40:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 15:40:33,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:40:33,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1036333648, now seen corresponding path program 1 times [2022-11-25 15:40:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:33,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677926189] [2022-11-25 15:40:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:33,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677926189] [2022-11-25 15:40:33,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677926189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:33,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:33,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678193404] [2022-11-25 15:40:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,816 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,833 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-11-25 15:40:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 15:40:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,834 INFO L225 Difference]: With dead ends: 18 [2022-11-25 15:40:33,835 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 15:40:33,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,836 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 15:40:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 15:40:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-11-25 15:40:33,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 12 [2022-11-25 15:40:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,840 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-11-25 15:40:33,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-11-25 15:40:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 15:40:33,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:40:33,852 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:33,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1036333649, now seen corresponding path program 1 times [2022-11-25 15:40:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:33,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211843142] [2022-11-25 15:40:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211843142] [2022-11-25 15:40:33,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211843142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:33,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:33,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:40:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539840787] [2022-11-25 15:40:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:33,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,950 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:33,974 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-11-25 15:40:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 15:40:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:33,980 INFO L225 Difference]: With dead ends: 17 [2022-11-25 15:40:33,980 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 15:40:33,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:33,981 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:33,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 15:40:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-25 15:40:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-11-25 15:40:33,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 12 [2022-11-25 15:40:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:33,996 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-11-25 15:40:33,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-11-25 15:40:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:40:33,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:33,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:40:33,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -515776973, now seen corresponding path program 1 times [2022-11-25 15:40:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625829923] [2022-11-25 15:40:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:34,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625829923] [2022-11-25 15:40:34,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625829923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:34,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:34,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:40:34,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248817668] [2022-11-25 15:40:34,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:34,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:40:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:40:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:40:34,734 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:35,561 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-11-25 15:40:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:40:35,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 15:40:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:35,562 INFO L225 Difference]: With dead ends: 15 [2022-11-25 15:40:35,562 INFO L226 Difference]: Without dead ends: 15 [2022-11-25 15:40:35,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-25 15:40:35,564 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:35,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:40:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-25 15:40:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-25 15:40:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2022-11-25 15:40:35,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2022-11-25 15:40:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:35,567 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2022-11-25 15:40:35,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-11-25 15:40:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:40:35,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:35,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:35,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:40:35,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-11-25 15:40:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -515776908, now seen corresponding path program 1 times [2022-11-25 15:40:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772939698] [2022-11-25 15:40:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:35,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772939698] [2022-11-25 15:40:35,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772939698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:35,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:35,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:40:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648467880] [2022-11-25 15:40:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:35,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:40:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:40:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:35,615 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:35,628 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-11-25 15:40:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:40:35,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 15:40:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:35,629 INFO L225 Difference]: With dead ends: 14 [2022-11-25 15:40:35,629 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:40:35,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:40:35,631 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:35,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:40:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:40:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:40:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:40:35,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-11-25 15:40:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:35,642 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:40:35,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:40:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:40:35,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:40:35,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2022-11-25 15:40:35,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-11-25 15:40:35,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-11-25 15:40:35,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-11-25 15:40:35,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-11-25 15:40:35,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-11-25 15:40:35,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-11-25 15:40:35,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-11-25 15:40:35,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-11-25 15:40:35,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-11-25 15:40:35,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-11-25 15:40:35,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-11-25 15:40:35,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2022-11-25 15:40:35,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-11-25 15:40:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:40:35,658 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:35,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:40:35,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:40:35 BoogieIcfgContainer [2022-11-25 15:40:35,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:40:35,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:40:35,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:40:35,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:40:35,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:40:29" (3/4) ... [2022-11-25 15:40:35,673 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:40:35,689 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-25 15:40:35,689 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-25 15:40:35,689 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 15:40:35,690 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:40:35,742 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:40:35,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:40:35,744 INFO L158 Benchmark]: Toolchain (without parser) took 6702.74ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 110.5MB in the beginning and 72.6MB in the end (delta: 37.9MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,744 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:40:35,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.48ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 100.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 155.2MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,746 INFO L158 Benchmark]: Boogie Preprocessor took 25.96ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 97.6MB in the end (delta: 956.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:40:35,747 INFO L158 Benchmark]: RCFGBuilder took 531.41ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 85.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,748 INFO L158 Benchmark]: TraceAbstraction took 5749.59ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 85.0MB in the beginning and 75.7MB in the end (delta: 9.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,749 INFO L158 Benchmark]: Witness Printer took 76.40ms. Allocated memory is still 188.7MB. Free memory was 75.7MB in the beginning and 72.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:40:35,751 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.35ms. Allocated memory is still 155.2MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.48ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 100.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 155.2MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.96ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 97.6MB in the end (delta: 956.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 531.41ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 85.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5749.59ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 85.0MB in the beginning and 75.7MB in the end (delta: 9.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 76.40ms. Allocated memory is still 188.7MB. Free memory was 75.7MB in the beginning and 72.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 144 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 76, 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 1073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 15:40:35,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b8bd49-901f-41ae-a981-6a5f56ce874f/bin/uautomizer-ZsLfNo2U6R/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 Result: TRUE