./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --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 092a946b6422703b24f2f29cdd90520b88845f5a5cf31cd89857d48af412e152 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:11:17,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:11:18,102 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:11:18,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:11:18,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:11:18,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:11:18,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:11:18,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:11:18,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:11:18,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:11:18,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:11:18,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:11:18,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:11:18,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:11:18,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:11:18,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:11:18,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:11:18,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:11:18,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:11:18,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:11:18,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:11:18,171 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:11:18,172 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:11:18,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:11:18,172 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:11:18,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:11:18,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:11:18,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:11:18,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:11:18,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:11:18,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:11:18,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:11:18,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:11:18,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:11:18,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:11:18,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:11:18,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:11:18,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:11:18,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:11:18,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:11:18,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:11:18,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:11:18,179 INFO L153 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_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/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_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 092a946b6422703b24f2f29cdd90520b88845f5a5cf31cd89857d48af412e152 [2024-11-08 17:11:18,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:11:18,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:11:18,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:11:18,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:11:18,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:11:18,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/ldv-regression/test16.c Unable to find full path for "g++" [2024-11-08 17:11:21,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:11:21,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:11:21,391 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/sv-benchmarks/c/ldv-regression/test16.c [2024-11-08 17:11:21,404 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/data/439d025dd/13390e6bfef44e4e85127e8033ba053b/FLAG129d9a1f0 [2024-11-08 17:11:21,673 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/data/439d025dd/13390e6bfef44e4e85127e8033ba053b [2024-11-08 17:11:21,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:11:21,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:11:21,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:11:21,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:11:21,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:11:21,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:11:21" (1/1) ... [2024-11-08 17:11:21,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1740f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:21, skipping insertion in model container [2024-11-08 17:11:21,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:11:21" (1/1) ... [2024-11-08 17:11:21,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:11:22,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:11:22,051 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:11:22,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:11:22,102 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:11:22,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22 WrapperNode [2024-11-08 17:11:22,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:11:22,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:11:22,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:11:22,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:11:22,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,157 INFO L138 Inliner]: procedures = 12, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-08 17:11:22,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:11:22,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:11:22,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:11:22,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:11:22,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,199 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 3 writes are split as follows [0, 2, 1]. [2024-11-08 17:11:22,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:11:22,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:11:22,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:11:22,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:11:22,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (1/1) ... [2024-11-08 17:11:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:11:22,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:11:22,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:11:22,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:11:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:11:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:11:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:11:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:11:22,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:11:22,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:11:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:11:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:11:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:11:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:11:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:11:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:11:22,434 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:11:22,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:11:22,823 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 17:11:22,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:11:22,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:11:22,846 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 17:11:22,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:11:22 BoogieIcfgContainer [2024-11-08 17:11:22,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:11:22,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:11:22,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:11:22,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:11:22,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:11:21" (1/3) ... [2024-11-08 17:11:22,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aeb979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:11:22, skipping insertion in model container [2024-11-08 17:11:22,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:11:22" (2/3) ... [2024-11-08 17:11:22,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aeb979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:11:22, skipping insertion in model container [2024-11-08 17:11:22,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:11:22" (3/3) ... [2024-11-08 17:11:22,867 INFO L112 eAbstractionObserver]: Analyzing ICFG test16.c [2024-11-08 17:11:22,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:11:22,897 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-08 17:11:22,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:11:23,010 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@64f685eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:11:23,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-08 17:11:23,018 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) [2024-11-08 17:11:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 17:11:23,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:23,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-08 17:11:23,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:23,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-08 17:11:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548744719] [2024-11-08 17:11:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548744719] [2024-11-08 17:11:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548744719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:23,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:11:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806365506] [2024-11-08 17:11:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:11:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:11:23,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:11:23,469 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:23,539 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2024-11-08 17:11:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:11:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-08 17:11:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:23,554 INFO L225 Difference]: With dead ends: 29 [2024-11-08 17:11:23,555 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 17:11:23,557 INFO L431 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 [2024-11-08 17:11:23,564 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:23,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 17:11:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 17:11:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.8571428571428572) 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) [2024-11-08 17:11:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2024-11-08 17:11:23,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 3 [2024-11-08 17:11:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:23,626 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2024-11-08 17:11:23,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2024-11-08 17:11:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 17:11:23,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:23,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-08 17:11:23,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:11:23,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:23,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-08 17:11:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922794806] [2024-11-08 17:11:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:23,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922794806] [2024-11-08 17:11:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922794806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:11:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838681540] [2024-11-08 17:11:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:11:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:11:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:11:23,852 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:23,920 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2024-11-08 17:11:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:11:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-08 17:11:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:23,925 INFO L225 Difference]: With dead ends: 26 [2024-11-08 17:11:23,925 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 17:11:23,926 INFO L431 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 [2024-11-08 17:11:23,928 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:23,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:11:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 17:11:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 17:11:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.7857142857142858) 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) [2024-11-08 17:11:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2024-11-08 17:11:23,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 3 [2024-11-08 17:11:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:23,936 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2024-11-08 17:11:23,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2024-11-08 17:11:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:11:23,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:23,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:11:23,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:11:23,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:23,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-08 17:11:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:23,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285262071] [2024-11-08 17:11:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285262071] [2024-11-08 17:11:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285262071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:11:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44057937] [2024-11-08 17:11:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:11:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:11:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:11:24,077 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:24,115 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2024-11-08 17:11:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:11:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:11:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:24,117 INFO L225 Difference]: With dead ends: 25 [2024-11-08 17:11:24,117 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 17:11:24,118 INFO L431 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 [2024-11-08 17:11:24,120 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 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 [2024-11-08 17:11:24,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 17:11:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-08 17:11:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.7142857142857142) 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) [2024-11-08 17:11:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2024-11-08 17:11:24,127 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 4 [2024-11-08 17:11:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:24,128 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2024-11-08 17:11:24,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-11-08 17:11:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:11:24,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:24,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:11:24,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:11:24,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-08 17:11:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666415333] [2024-11-08 17:11:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666415333] [2024-11-08 17:11:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666415333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:11:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503576315] [2024-11-08 17:11:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:11:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:11:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:11:24,269 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:24,325 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-11-08 17:11:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:11:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:11:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:24,330 INFO L225 Difference]: With dead ends: 24 [2024-11-08 17:11:24,330 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 17:11:24,331 INFO L431 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 [2024-11-08 17:11:24,337 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:24,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:11:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 17:11:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 17:11:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.6428571428571428) 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) [2024-11-08 17:11:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2024-11-08 17:11:24,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 4 [2024-11-08 17:11:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:24,348 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2024-11-08 17:11:24,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2024-11-08 17:11:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:11:24,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:24,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:11:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:11:24,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-08 17:11:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672746493] [2024-11-08 17:11:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:24,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672746493] [2024-11-08 17:11:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672746493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:11:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125217321] [2024-11-08 17:11:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:11:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:11:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:11:24,442 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:24,513 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-11-08 17:11:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:11:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 17:11:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:24,515 INFO L225 Difference]: With dead ends: 23 [2024-11-08 17:11:24,516 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 17:11:24,516 INFO L431 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 [2024-11-08 17:11:24,519 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:24,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 17:11:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 17:11:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.5714285714285714) 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) [2024-11-08 17:11:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-11-08 17:11:24,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 5 [2024-11-08 17:11:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:24,533 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-11-08 17:11:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-11-08 17:11:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:11:24,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:24,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:11:24,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:11:24,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:24,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-08 17:11:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621184556] [2024-11-08 17:11:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621184556] [2024-11-08 17:11:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621184556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:11:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383767116] [2024-11-08 17:11:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:11:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:11:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:11:24,752 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:24,810 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-11-08 17:11:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:11:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 17:11:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:24,812 INFO L225 Difference]: With dead ends: 22 [2024-11-08 17:11:24,812 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 17:11:24,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:11:24,814 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:24,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 10 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 17:11:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-08 17:11:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.5) 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) [2024-11-08 17:11:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-11-08 17:11:24,819 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 5 [2024-11-08 17:11:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:24,820 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-11-08 17:11:24,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-08 17:11:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:11:24,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:24,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:11:24,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:11:24,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2024-11-08 17:11:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513600223] [2024-11-08 17:11:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513600223] [2024-11-08 17:11:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513600223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:11:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454078451] [2024-11-08 17:11:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:11:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:11:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:11:24,896 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:24,953 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-08 17:11:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:11:24,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:11:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:24,954 INFO L225 Difference]: With dead ends: 21 [2024-11-08 17:11:24,954 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 17:11:24,955 INFO L431 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 [2024-11-08 17:11:24,956 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9 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 [2024-11-08 17:11:24,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 17:11:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 17:11:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) 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) [2024-11-08 17:11:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-08 17:11:24,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 6 [2024-11-08 17:11:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:24,967 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-08 17:11:24,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-08 17:11:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:11:24,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:24,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:11:24,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:11:24,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2024-11-08 17:11:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564897777] [2024-11-08 17:11:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564897777] [2024-11-08 17:11:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564897777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:11:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024954796] [2024-11-08 17:11:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:11:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:11:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:11:25,173 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:25,230 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-11-08 17:11:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:11:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:11:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:25,233 INFO L225 Difference]: With dead ends: 20 [2024-11-08 17:11:25,233 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 17:11:25,234 INFO L431 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 [2024-11-08 17:11:25,235 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:25,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 9 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 17:11:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 17:11:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.3571428571428572) 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) [2024-11-08 17:11:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2024-11-08 17:11:25,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 6 [2024-11-08 17:11:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2024-11-08 17:11:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-11-08 17:11:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:11:25,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:25,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:25,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:11:25,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:25,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 59261611, now seen corresponding path program 1 times [2024-11-08 17:11:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627892113] [2024-11-08 17:11:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627892113] [2024-11-08 17:11:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627892113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:11:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093494736] [2024-11-08 17:11:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:11:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:11:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:11:25,453 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:25,536 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-08 17:11:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:11:25,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 17:11:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:25,538 INFO L225 Difference]: With dead ends: 19 [2024-11-08 17:11:25,538 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 17:11:25,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:11:25,540 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:25,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 17:11:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 17:11:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) 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) [2024-11-08 17:11:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-11-08 17:11:25,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 8 [2024-11-08 17:11:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:25,548 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-11-08 17:11:25,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-11-08 17:11:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:11:25,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:25,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:25,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:11:25,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:25,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash 59261612, now seen corresponding path program 1 times [2024-11-08 17:11:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:25,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071795218] [2024-11-08 17:11:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:25,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:25,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071795218] [2024-11-08 17:11:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071795218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:11:25,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613359617] [2024-11-08 17:11:25,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:25,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:11:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:25,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:11:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:11:25,722 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:25,795 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2024-11-08 17:11:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:11:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 17:11:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:25,796 INFO L225 Difference]: With dead ends: 18 [2024-11-08 17:11:25,796 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 17:11:25,796 INFO L431 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 [2024-11-08 17:11:25,797 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:25,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 17:11:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 17:11:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) 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) [2024-11-08 17:11:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2024-11-08 17:11:25,804 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 8 [2024-11-08 17:11:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:25,804 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2024-11-08 17:11:25,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2024-11-08 17:11:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:11:25,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:25,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:25,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:11:25,807 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109930, now seen corresponding path program 1 times [2024-11-08 17:11:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:25,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203367634] [2024-11-08 17:11:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203367634] [2024-11-08 17:11:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203367634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:11:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128936560] [2024-11-08 17:11:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:11:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:11:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:11:25,920 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:25,984 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2024-11-08 17:11:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:11:25,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 17:11:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:25,985 INFO L225 Difference]: With dead ends: 17 [2024-11-08 17:11:25,985 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 17:11:25,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:11:25,988 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:25,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 17:11:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-08 17:11:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.1428571428571428) 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) [2024-11-08 17:11:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-08 17:11:25,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 9 [2024-11-08 17:11:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:25,992 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-08 17:11:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-08 17:11:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:11:25,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:25,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:11:25,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109931, now seen corresponding path program 1 times [2024-11-08 17:11:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950148831] [2024-11-08 17:11:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950148831] [2024-11-08 17:11:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950148831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:11:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679636398] [2024-11-08 17:11:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:26,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:11:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:11:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:11:26,294 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:26,358 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-08 17:11:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:11:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 17:11:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:26,361 INFO L225 Difference]: With dead ends: 16 [2024-11-08 17:11:26,362 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 17:11:26,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:11:26,363 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:26,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 17:11:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 17:11:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-08 17:11:26,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 9 [2024-11-08 17:11:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:26,371 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-08 17:11:26,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-08 17:11:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 17:11:26,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:26,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:26,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:11:26,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:26,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1426334128, now seen corresponding path program 1 times [2024-11-08 17:11:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872812613] [2024-11-08 17:11:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872812613] [2024-11-08 17:11:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872812613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:26,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:11:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372485546] [2024-11-08 17:11:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:11:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:26,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:11:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:11:26,682 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2024-11-08 17:11:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:26,901 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-11-08 17:11:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:11:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 [2024-11-08 17:11:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:26,902 INFO L225 Difference]: With dead ends: 13 [2024-11-08 17:11:26,905 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 17:11:26,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:11:26,906 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:11:26,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:11:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 17:11:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-08 17:11:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 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) [2024-11-08 17:11:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2024-11-08 17:11:26,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 12 [2024-11-08 17:11:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:26,915 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2024-11-08 17:11:26,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2024-11-08 17:11:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2024-11-08 17:11:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 17:11:26,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:11:26,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:26,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:11:26,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-08 17:11:26,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:11:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1426332013, now seen corresponding path program 1 times [2024-11-08 17:11:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:11:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641296182] [2024-11-08 17:11:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:11:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:11:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:11:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:11:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:11:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641296182] [2024-11-08 17:11:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641296182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:11:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:11:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:11:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154672668] [2024-11-08 17:11:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:11:26,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:11:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:11:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:11:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:11:26,963 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:11:26,984 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-11-08 17:11:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:11:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-08 17:11:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:11:26,985 INFO L225 Difference]: With dead ends: 12 [2024-11-08 17:11:26,985 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 17:11:26,986 INFO L431 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 [2024-11-08 17:11:26,986 INFO L432 NwaCegarLoop]: 5 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, 5 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 [2024-11-08 17:11:26,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:11:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 17:11:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 17:11:26,990 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) [2024-11-08 17:11:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 17:11:26,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-08 17:11:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:11:26,991 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 17:11:26,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:11:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 17:11:26,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 17:11:26,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-08 17:11:26,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-08 17:11:26,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-08 17:11:26,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-08 17:11:26,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-08 17:11:26,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-08 17:11:26,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-08 17:11:26,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-08 17:11:26,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-08 17:11:26,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-08 17:11:26,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-08 17:11:26,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-08 17:11:26,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2024-11-08 17:11:26,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-11-08 17:11:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:11:27,004 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:11:27,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:11:27,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:11:27 BoogieIcfgContainer [2024-11-08 17:11:27,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:11:27,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:11:27,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:11:27,015 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:11:27,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:11:22" (3/4) ... [2024-11-08 17:11:27,019 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 17:11:27,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 17:11:27,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 17:11:27,035 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 17:11:27,035 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 17:11:27,154 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 17:11:27,154 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 17:11:27,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:11:27,155 INFO L158 Benchmark]: Toolchain (without parser) took 5474.43ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 111.8MB in the beginning and 150.5MB in the end (delta: -38.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,156 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:11:27,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.57ms. Allocated memory is still 144.7MB. Free memory was 111.8MB in the beginning and 99.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.88ms. Allocated memory is still 144.7MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,157 INFO L158 Benchmark]: Boogie Preprocessor took 53.00ms. Allocated memory is still 144.7MB. Free memory was 98.0MB in the beginning and 96.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,158 INFO L158 Benchmark]: RCFGBuilder took 633.72ms. Allocated memory is still 144.7MB. Free memory was 96.4MB in the beginning and 83.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,158 INFO L158 Benchmark]: TraceAbstraction took 4160.28ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 83.0MB in the beginning and 154.7MB in the end (delta: -71.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:11:27,159 INFO L158 Benchmark]: Witness Printer took 139.96ms. Allocated memory is still 197.1MB. Free memory was 154.7MB in the beginning and 150.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:11:27,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.57ms. Allocated memory is still 144.7MB. Free memory was 111.8MB in the beginning and 99.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.88ms. Allocated memory is still 144.7MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.00ms. Allocated memory is still 144.7MB. Free memory was 98.0MB in the beginning and 96.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 633.72ms. Allocated memory is still 144.7MB. Free memory was 96.4MB in the beginning and 83.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4160.28ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 83.0MB in the beginning and 154.7MB in the end (delta: -71.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 139.96ms. Allocated memory is still 197.1MB. Free memory was 154.7MB in the beginning and 150.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: 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: 4.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 119 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 60, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 543 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! [2024-11-08 17:11:27,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8573d66-f267-4c40-94dd-2e1d16d58b7e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE