./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-dietlibc/strtok_r.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-dietlibc/strtok_r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:50:07,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:50:07,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 04:50:07,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:50:07,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:50:07,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:50:07,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:50:07,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:50:07,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:50:07,987 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:50:07,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:50:07,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:50:07,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:50:07,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:50:07,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:50:07,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:50:07,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:50:07,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:50:07,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:50:07,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:50:07,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:50:07,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:50:07,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:50:07,993 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d [2024-11-28 04:50:08,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:50:08,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:50:08,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:50:08,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:50:08,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:50:08,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-dietlibc/strtok_r.i [2024-11-28 04:50:11,249 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8f5e9e7/f68ae8b763ba4e13a81422c072cce155/FLAGf4fa160a6 [2024-11-28 04:50:11,264 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-28 04:50:11,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:50:11,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/sv-benchmarks/c/termination-dietlibc/strtok_r.i [2024-11-28 04:50:11,607 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8f5e9e7/f68ae8b763ba4e13a81422c072cce155/FLAGf4fa160a6 [2024-11-28 04:50:11,628 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8f5e9e7/f68ae8b763ba4e13a81422c072cce155 [2024-11-28 04:50:11,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:50:11,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:50:11,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:50:11,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:50:11,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:50:11,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:11" (1/1) ... [2024-11-28 04:50:11,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18996918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:11, skipping insertion in model container [2024-11-28 04:50:11,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:11" (1/1) ... [2024-11-28 04:50:11,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:50:12,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:50:12,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:50:12,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:50:12,145 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:50:12,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12 WrapperNode [2024-11-28 04:50:12,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:50:12,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:50:12,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:50:12,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:50:12,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,185 INFO L138 Inliner]: procedures = 118, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-11-28 04:50:12,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:50:12,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:50:12,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:50:12,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:50:12,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,215 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [5, 8, 3]. 50 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 0, 1]. The 3 writes are split as follows [0, 2, 1]. [2024-11-28 04:50:12,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:50:12,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:50:12,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:50:12,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:50:12,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (1/1) ... [2024-11-28 04:50:12,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:50:12,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:50:12,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:50:12,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:50:12,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:50:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:50:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:50:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:50:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:50:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:50:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:50:12,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:50:12,478 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:50:12,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:50:12,945 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-28 04:50:12,945 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:50:12,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:50:12,957 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 04:50:12,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:12 BoogieIcfgContainer [2024-11-28 04:50:12,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:50:12,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:50:12,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:50:12,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:50:12,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:11" (1/3) ... [2024-11-28 04:50:12,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c5b006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:12, skipping insertion in model container [2024-11-28 04:50:12,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:12" (2/3) ... [2024-11-28 04:50:12,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c5b006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:12, skipping insertion in model container [2024-11-28 04:50:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:12" (3/3) ... [2024-11-28 04:50:12,970 INFO L128 eAbstractionObserver]: Analyzing ICFG strtok_r.i [2024-11-28 04:50:12,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:50:12,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strtok_r.i that has 1 procedures, 78 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2024-11-28 04:50:13,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:50:13,068 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;@ff8f48a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:50:13,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-28 04:50:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 77 states have internal predecessors, (93), 0 states have call successors, (0), 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-28 04:50:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:50:13,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:13,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:50:13,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:13,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 925757, now seen corresponding path program 1 times [2024-11-28 04:50:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:13,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349962996] [2024-11-28 04:50:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:13,306 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-28 04:50:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349962996] [2024-11-28 04:50:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349962996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:50:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925466507] [2024-11-28 04:50:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:13,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:13,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:13,356 INFO L87 Difference]: Start difference. First operand has 78 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 77 states have internal predecessors, (93), 0 states have call successors, (0), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:13,498 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-11-28 04:50:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:50:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:13,511 INFO L225 Difference]: With dead ends: 79 [2024-11-28 04:50:13,511 INFO L226 Difference]: Without dead ends: 76 [2024-11-28 04:50:13,514 INFO L434 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-28 04:50:13,520 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:13,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-28 04:50:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-28 04:50:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 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-28 04:50:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-11-28 04:50:13,570 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 4 [2024-11-28 04:50:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:13,570 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-11-28 04:50:13,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-11-28 04:50:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:50:13,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:13,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:50:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:50:13,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:13,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-28 04:50:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:13,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051630001] [2024-11-28 04:50:13,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:13,680 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-28 04:50:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051630001] [2024-11-28 04:50:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051630001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:50:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481727386] [2024-11-28 04:50:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:13,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:13,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:13,684 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:13,780 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-28 04:50:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:50:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:13,785 INFO L225 Difference]: With dead ends: 75 [2024-11-28 04:50:13,785 INFO L226 Difference]: Without dead ends: 75 [2024-11-28 04:50:13,786 INFO L434 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-28 04:50:13,786 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:13,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-28 04:50:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-28 04:50:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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-28 04:50:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-28 04:50:13,795 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2024-11-28 04:50:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:13,796 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-28 04:50:13,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-28 04:50:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:50:13,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:13,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:50:13,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:50:13,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-28 04:50:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600549967] [2024-11-28 04:50:13,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:14,064 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-28 04:50:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600549967] [2024-11-28 04:50:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600549967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399045136] [2024-11-28 04:50:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:50:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:50:14,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,067 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:14,204 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-28 04:50:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:50:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:50:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:14,206 INFO L225 Difference]: With dead ends: 74 [2024-11-28 04:50:14,206 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 04:50:14,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,207 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:14,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 04:50:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 04:50:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 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-28 04:50:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-28 04:50:14,221 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 4 [2024-11-28 04:50:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:14,221 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-28 04:50:14,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-28 04:50:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:50:14,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:14,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:50:14,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:14,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782776, now seen corresponding path program 1 times [2024-11-28 04:50:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574880621] [2024-11-28 04:50:14,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:14,426 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-28 04:50:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574880621] [2024-11-28 04:50:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574880621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371197686] [2024-11-28 04:50:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:50:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:14,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:50:14,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,428 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:14,549 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-28 04:50:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:50:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-28 04:50:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:14,553 INFO L225 Difference]: With dead ends: 75 [2024-11-28 04:50:14,553 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 04:50:14,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,554 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 04:50:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 04:50:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 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-28 04:50:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-28 04:50:14,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 7 [2024-11-28 04:50:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:14,567 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-28 04:50:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-28 04:50:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 04:50:14,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:14,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:50:14,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 175688811, now seen corresponding path program 1 times [2024-11-28 04:50:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426927261] [2024-11-28 04:50:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:14,704 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-28 04:50:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426927261] [2024-11-28 04:50:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426927261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:14,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:50:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660882647] [2024-11-28 04:50:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:50:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:14,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:50:14,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,706 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-28 04:50:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:14,780 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-28 04:50:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:50:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-28 04:50:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:14,782 INFO L225 Difference]: With dead ends: 70 [2024-11-28 04:50:14,783 INFO L226 Difference]: Without dead ends: 70 [2024-11-28 04:50:14,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:14,785 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 129 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-28 04:50:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-28 04:50:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.813953488372093) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 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-28 04:50:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-28 04:50:14,830 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 8 [2024-11-28 04:50:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:14,831 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-28 04:50:14,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-28 04:50:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-28 04:50:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:50:14,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:14,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:14,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:50:14,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1151391829, now seen corresponding path program 1 times [2024-11-28 04:50:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261288765] [2024-11-28 04:50:14,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:15,120 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-28 04:50:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261288765] [2024-11-28 04:50:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261288765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:50:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279560456] [2024-11-28 04:50:15,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:15,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:50:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:15,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:50:15,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:50:15,123 INFO L87 Difference]: Start difference. First operand 70 states and 78 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-28 04:50:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:15,291 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-28 04:50:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:50:15,292 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-28 04:50:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:15,292 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:50:15,292 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:50:15,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:15,293 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:15,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 93 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:50:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 04:50:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 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-28 04:50:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-28 04:50:15,298 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 9 [2024-11-28 04:50:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-28 04:50:15,298 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-28 04:50:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-28 04:50:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:50:15,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:15,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:50:15,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:15,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1151391830, now seen corresponding path program 1 times [2024-11-28 04:50:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431749486] [2024-11-28 04:50:15,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:15,801 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-28 04:50:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431749486] [2024-11-28 04:50:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431749486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:15,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:50:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606254215] [2024-11-28 04:50:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:15,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:15,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:15,803 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 6 states, 5 states have (on average 1.8) 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-28 04:50:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:16,061 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-11-28 04:50:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:16,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) 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-28 04:50:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:16,063 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:50:16,063 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:50:16,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:50:16,066 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:16,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:50:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:50:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2024-11-28 04:50:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 76 states have internal predecessors, (92), 0 states have call successors, (0), 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-28 04:50:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-11-28 04:50:16,079 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 9 [2024-11-28 04:50:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-11-28 04:50:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) 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-28 04:50:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-11-28 04:50:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:50:16,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:16,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:50:16,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1505157973, now seen corresponding path program 1 times [2024-11-28 04:50:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539763462] [2024-11-28 04:50:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:16,290 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-28 04:50:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:16,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539763462] [2024-11-28 04:50:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539763462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:50:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067535868] [2024-11-28 04:50:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:16,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:50:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:16,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:50:16,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:50:16,292 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-28 04:50:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:16,440 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2024-11-28 04:50:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:50:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-28 04:50:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:16,442 INFO L225 Difference]: With dead ends: 79 [2024-11-28 04:50:16,442 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 04:50:16,442 INFO L434 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-28 04:50:16,443 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:16,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 130 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 04:50:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-28 04:50:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 73 states have internal predecessors, (87), 0 states have call successors, (0), 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-28 04:50:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2024-11-28 04:50:16,448 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 12 [2024-11-28 04:50:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2024-11-28 04:50:16,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-28 04:50:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2024-11-28 04:50:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:50:16,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:16,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:16,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:50:16,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1505157974, now seen corresponding path program 1 times [2024-11-28 04:50:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153607976] [2024-11-28 04:50:16,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:16,853 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-28 04:50:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153607976] [2024-11-28 04:50:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153607976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:50:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113787407] [2024-11-28 04:50:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:50:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:50:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:50:16,854 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-28 04:50:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:17,104 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2024-11-28 04:50:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:50:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-28 04:50:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:17,109 INFO L225 Difference]: With dead ends: 97 [2024-11-28 04:50:17,109 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 04:50:17,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:50:17,113 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 87 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:17,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 170 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:50:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 04:50:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-11-28 04:50:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 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-28 04:50:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-11-28 04:50:17,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 12 [2024-11-28 04:50:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:17,123 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-11-28 04:50:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-28 04:50:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-11-28 04:50:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:50:17,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:17,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:50:17,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:17,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -584641853, now seen corresponding path program 1 times [2024-11-28 04:50:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496474454] [2024-11-28 04:50:17,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:17,593 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-28 04:50:17,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:17,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496474454] [2024-11-28 04:50:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496474454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:50:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421738423] [2024-11-28 04:50:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:17,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:50:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:17,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:50:17,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:50:17,595 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-28 04:50:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:17,882 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2024-11-28 04:50:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:50:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 04:50:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:17,883 INFO L225 Difference]: With dead ends: 124 [2024-11-28 04:50:17,884 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 04:50:17,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:50:17,886 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 162 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:17,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 194 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:50:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 04:50:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-11-28 04:50:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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-28 04:50:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2024-11-28 04:50:17,897 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 13 [2024-11-28 04:50:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:17,897 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2024-11-28 04:50:17,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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-28 04:50:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2024-11-28 04:50:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:50:17,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:17,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:50:17,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 799897924, now seen corresponding path program 1 times [2024-11-28 04:50:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325840142] [2024-11-28 04:50:17,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,039 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-28 04:50:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325840142] [2024-11-28 04:50:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325840142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:18,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:50:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119039209] [2024-11-28 04:50:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:18,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:18,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:18,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:18,042 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 04:50:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:18,100 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-11-28 04:50:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) Word has length 15 [2024-11-28 04:50:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:18,102 INFO L225 Difference]: With dead ends: 94 [2024-11-28 04:50:18,103 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:50:18,103 INFO L434 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-28 04:50:18,104 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:18,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:50:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 04:50:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.52) internal successors, (114), 93 states have internal predecessors, (114), 0 states have call successors, (0), 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-28 04:50:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2024-11-28 04:50:18,115 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 15 [2024-11-28 04:50:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:18,115 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2024-11-28 04:50:18,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 04:50:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2024-11-28 04:50:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:50:18,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:18,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:18,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:50:18,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:18,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 799897925, now seen corresponding path program 1 times [2024-11-28 04:50:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043167869] [2024-11-28 04:50:18,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,276 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-28 04:50:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043167869] [2024-11-28 04:50:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043167869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:50:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847230345] [2024-11-28 04:50:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:18,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:18,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:18,278 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 04:50:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:18,332 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-28 04:50:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) Word has length 15 [2024-11-28 04:50:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:18,334 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:50:18,334 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:50:18,334 INFO L434 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-28 04:50:18,335 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:18,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 49 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:50:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 04:50:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 92 states have internal predecessors, (113), 0 states have call successors, (0), 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-28 04:50:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2024-11-28 04:50:18,345 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 15 [2024-11-28 04:50:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2024-11-28 04:50:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 04:50:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2024-11-28 04:50:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:50:18,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:18,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:18,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:50:18,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:18,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 799896007, now seen corresponding path program 1 times [2024-11-28 04:50:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532539954] [2024-11-28 04:50:18,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,517 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-28 04:50:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532539954] [2024-11-28 04:50:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532539954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139688508] [2024-11-28 04:50:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:50:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:50:18,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:18,518 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-28 04:50:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:18,629 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2024-11-28 04:50:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:50:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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) Word has length 15 [2024-11-28 04:50:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:18,630 INFO L225 Difference]: With dead ends: 94 [2024-11-28 04:50:18,630 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:50:18,630 INFO L434 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-28 04:50:18,631 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 41 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:18,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 98 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:50:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-28 04:50:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.5) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 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-28 04:50:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-11-28 04:50:18,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 15 [2024-11-28 04:50:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:18,637 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-11-28 04:50:18,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-28 04:50:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2024-11-28 04:50:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:50:18,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:18,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:18,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:50:18,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:18,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 799896006, now seen corresponding path program 1 times [2024-11-28 04:50:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155243468] [2024-11-28 04:50:18,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,782 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-28 04:50:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155243468] [2024-11-28 04:50:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155243468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:50:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112955412] [2024-11-28 04:50:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:18,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:50:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:18,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:50:18,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:50:18,784 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-28 04:50:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:18,896 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-28 04:50:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) Word has length 15 [2024-11-28 04:50:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:18,897 INFO L225 Difference]: With dead ends: 91 [2024-11-28 04:50:18,898 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:50:18,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:50:18,899 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 83 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:50:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 04:50:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 90 states have internal predecessors, (111), 0 states have call successors, (0), 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-28 04:50:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2024-11-28 04:50:18,903 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 15 [2024-11-28 04:50:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:18,903 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2024-11-28 04:50:18,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-28 04:50:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2024-11-28 04:50:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:50:18,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:18,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:18,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:50:18,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 908601482, now seen corresponding path program 1 times [2024-11-28 04:50:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399422589] [2024-11-28 04:50:18,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:50:18,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:18,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399422589] [2024-11-28 04:50:18,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399422589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:18,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:18,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434609316] [2024-11-28 04:50:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:18,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:18,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:18,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:18,946 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-28 04:50:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:18,959 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2024-11-28 04:50:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) Word has length 17 [2024-11-28 04:50:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:18,960 INFO L225 Difference]: With dead ends: 95 [2024-11-28 04:50:18,960 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 04:50:18,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:18,961 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:18,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:50:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 04:50:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 04:50:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4375) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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-28 04:50:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2024-11-28 04:50:18,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 17 [2024-11-28 04:50:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2024-11-28 04:50:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-28 04:50:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2024-11-28 04:50:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:50:18,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:18,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:50:18,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1898060679, now seen corresponding path program 1 times [2024-11-28 04:50:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191601407] [2024-11-28 04:50:18,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:50:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191601407] [2024-11-28 04:50:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191601407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:50:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691615611] [2024-11-28 04:50:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:19,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:19,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:19,058 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-28 04:50:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:19,117 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2024-11-28 04:50:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Word has length 18 [2024-11-28 04:50:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:19,119 INFO L225 Difference]: With dead ends: 101 [2024-11-28 04:50:19,120 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 04:50:19,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:19,120 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:19,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 04:50:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-28 04:50:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.430232558139535) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 04:50:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-11-28 04:50:19,125 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 18 [2024-11-28 04:50:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:19,125 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-11-28 04:50:19,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-28 04:50:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-11-28 04:50:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:50:19,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:19,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:19,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:50:19,127 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:19,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:19,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1280619866, now seen corresponding path program 1 times [2024-11-28 04:50:19,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220840839] [2024-11-28 04:50:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:19,530 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-28 04:50:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220840839] [2024-11-28 04:50:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220840839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:50:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264026861] [2024-11-28 04:50:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:19,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:19,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:19,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:19,533 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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-28 04:50:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:19,612 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-11-28 04:50:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:50:19,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) Word has length 18 [2024-11-28 04:50:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:19,613 INFO L225 Difference]: With dead ends: 100 [2024-11-28 04:50:19,613 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 04:50:19,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:19,615 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:19,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 04:50:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-28 04:50:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 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-28 04:50:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2024-11-28 04:50:19,620 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 18 [2024-11-28 04:50:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:19,620 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2024-11-28 04:50:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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-28 04:50:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2024-11-28 04:50:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:50:19,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:19,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:50:19,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1223425187, now seen corresponding path program 1 times [2024-11-28 04:50:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098855728] [2024-11-28 04:50:19,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:19,752 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-28 04:50:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098855728] [2024-11-28 04:50:19,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098855728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:19,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:19,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691163584] [2024-11-28 04:50:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:19,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:50:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:19,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:50:19,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:19,754 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-28 04:50:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:19,806 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-11-28 04:50:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:50:19,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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) Word has length 18 [2024-11-28 04:50:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:19,808 INFO L225 Difference]: With dead ends: 94 [2024-11-28 04:50:19,808 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:50:19,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:50:19,809 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:19,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 83 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:50:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:50:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 04:50:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 93 states have internal predecessors, (114), 0 states have call successors, (0), 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-28 04:50:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2024-11-28 04:50:19,812 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 18 [2024-11-28 04:50:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:19,812 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2024-11-28 04:50:19,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-28 04:50:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2024-11-28 04:50:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:50:19,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:19,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:19,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:50:19,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:19,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1223425188, now seen corresponding path program 1 times [2024-11-28 04:50:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498773325] [2024-11-28 04:50:19,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:20,072 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-28 04:50:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498773325] [2024-11-28 04:50:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498773325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:20,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:50:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015441526] [2024-11-28 04:50:20,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:20,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:20,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:20,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:20,073 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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-28 04:50:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:20,195 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-11-28 04:50:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) Word has length 18 [2024-11-28 04:50:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:20,196 INFO L225 Difference]: With dead ends: 106 [2024-11-28 04:50:20,196 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 04:50:20,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:20,197 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:20,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 142 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 04:50:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-28 04:50:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 97 states have internal predecessors, (119), 0 states have call successors, (0), 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-28 04:50:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2024-11-28 04:50:20,201 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 18 [2024-11-28 04:50:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2024-11-28 04:50:20,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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-28 04:50:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2024-11-28 04:50:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:50:20,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:20,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:20,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:50:20,203 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -728434487, now seen corresponding path program 1 times [2024-11-28 04:50:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:20,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059905145] [2024-11-28 04:50:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:20,342 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-28 04:50:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059905145] [2024-11-28 04:50:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059905145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:50:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487808670] [2024-11-28 04:50:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:20,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:50:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:20,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:50:20,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:50:20,344 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 04:50:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:20,416 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2024-11-28 04:50:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:50:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) Word has length 19 [2024-11-28 04:50:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:20,417 INFO L225 Difference]: With dead ends: 113 [2024-11-28 04:50:20,417 INFO L226 Difference]: Without dead ends: 113 [2024-11-28 04:50:20,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:20,418 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:20,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-28 04:50:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2024-11-28 04:50:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 98 states have internal predecessors, (120), 0 states have call successors, (0), 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-28 04:50:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-11-28 04:50:20,422 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 19 [2024-11-28 04:50:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-11-28 04:50:20,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 04:50:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-11-28 04:50:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:50:20,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:20,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:20,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:50:20,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-28 04:50:20,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1510087115, now seen corresponding path program 1 times [2024-11-28 04:50:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:20,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524754690] [2024-11-28 04:50:20,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:20,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:50:20,463 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:50:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:50:20,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 04:50:20,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 04:50:20,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2024-11-28 04:50:20,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2024-11-28 04:50:20,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2024-11-28 04:50:20,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2024-11-28 04:50:20,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2024-11-28 04:50:20,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2024-11-28 04:50:20,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2024-11-28 04:50:20,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2024-11-28 04:50:20,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2024-11-28 04:50:20,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2024-11-28 04:50:20,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2024-11-28 04:50:20,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2024-11-28 04:50:20,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2024-11-28 04:50:20,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2024-11-28 04:50:20,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2024-11-28 04:50:20,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:50:20,532 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:20,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:50:20,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:50:20 BoogieIcfgContainer [2024-11-28 04:50:20,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:50:20,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:50:20,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:50:20,570 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:50:20,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:12" (3/4) ... [2024-11-28 04:50:20,572 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 04:50:20,640 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 8. [2024-11-28 04:50:20,708 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:50:20,709 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:50:20,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:50:20,710 INFO L158 Benchmark]: Toolchain (without parser) took 9076.07ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.2MB in the beginning and 70.9MB in the end (delta: 21.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-28 04:50:20,710 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:50:20,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.53ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 75.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:50:20,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 73.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:50:20,711 INFO L158 Benchmark]: Boogie Preprocessor took 48.91ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:50:20,712 INFO L158 Benchmark]: RCFGBuilder took 722.73ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 48.7MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:50:20,712 INFO L158 Benchmark]: TraceAbstraction took 7607.46ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 48.2MB in the beginning and 76.3MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:50:20,713 INFO L158 Benchmark]: Witness Printer took 140.65ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 70.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:50:20,715 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.38ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.53ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 75.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 73.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.91ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 722.73ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 48.7MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7607.46ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 48.2MB in the beginning and 76.3MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 140.65ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 70.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L543] int in_len = __VERIFIER_nondet_int(); [L544] COND FALSE !(in_len < 1) [L545] char* in = __builtin_alloca (in_len); VAL [in={3:0}, in_len=8] [L546] in[in_len-1]=0 [L547] int delim_len = __VERIFIER_nondet_int(); [L548] COND FALSE !(delim_len < 1) [L549] char* delim = __builtin_alloca (delim_len); [L550] char* ptr = 0; [L550] char* ptr = 0; [L551] CALL strtok_r(in, delim, &ptr) [L531] char*tmp=0; VAL [delim={4:0}, ptrptr={2:0}, s={3:0}, tmp={0:0}] [L532] COND FALSE !(s==0) [L533] CALL strspn(s,delim) [L508] size_t l = 0; [L509] const char *a; VAL [accept={4:0}, l=0, s={3:0}] [L510] EXPR \read(*s) [L510] COND TRUE *s [L511] a = accept VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] EXPR \read(*a) [L511] *a && *s != *a VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] *a && *s != *a [L511] EXPR \read(*s) [L511] EXPR \read(*a) [L511] *a && *s != *a VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] a++ VAL [a={4:1}, accept={4:0}, l=0, s={3:0}] [L511] \read(*a) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 2762 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1635 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1443 IncrementalHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1127 mSDtfsCounter, 1443 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=16, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2/2 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 04:50:20,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b797746-565d-423b-ac77-d58dea930164/bin/uautomizer-verify-aQ6SnzHsRB/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)