./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-dietlibc/strtok_r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya --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.2.4-dev-0e0057c [2023-11-29 01:58:19,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:58:19,178 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 01:58:19,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:58:19,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:58:19,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:58:19,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:58:19,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:58:19,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:58:19,210 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:58:19,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:58:19,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:58:19,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:58:19,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:58:19,213 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:58:19,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:58:19,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:58:19,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:58:19,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:58:19,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:58:19,216 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:58:19,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:58:19,222 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:58:19,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:58:19,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:58:19,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:58:19,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:58:19,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:58:19,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:58:19,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:58:19,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:58:19,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:58:19,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:58:19,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:58:19,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:58:19,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:58:19,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:58:19,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:58:19,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 01:58:19,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:58:19,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:58:19,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:58:19,496 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:58:19,496 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:58:19,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-dietlibc/strtok_r.i [2023-11-29 01:58:22,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:58:22,515 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:58:22,516 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/sv-benchmarks/c/termination-dietlibc/strtok_r.i [2023-11-29 01:58:22,530 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/data/d49da4d6c/eeb04fb8deed47e28f396176b8789cca/FLAG8a37d84c3 [2023-11-29 01:58:22,542 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/data/d49da4d6c/eeb04fb8deed47e28f396176b8789cca [2023-11-29 01:58:22,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:58:22,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:58:22,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:58:22,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:58:22,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:58:22,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d777921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22, skipping insertion in model container [2023-11-29 01:58:22,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:58:22,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:58:22,858 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:58:22,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:58:22,931 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:58:22,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22 WrapperNode [2023-11-29 01:58:22,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:58:22,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:58:22,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:58:22,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:58:22,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,979 INFO L138 Inliner]: procedures = 118, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2023-11-29 01:58:22,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:58:22,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:58:22,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:58:22,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:58:22,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:22,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,022 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [8, 3, 5]. 50 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1, 0]. The 3 writes are split as follows [2, 1, 0]. [2023-11-29 01:58:23,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:58:23,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:58:23,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:58:23,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:58:23,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (1/1) ... [2023-11-29 01:58:23,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:58:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:58:23,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:58:23,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:58:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:58:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:58:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:58:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:58:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:58:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:58:23,229 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:58:23,231 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:58:23,513 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:58:23,549 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:58:23,549 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:58:23,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:58:23 BoogieIcfgContainer [2023-11-29 01:58:23,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:58:23,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:58:23,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:58:23,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:58:23,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:58:22" (1/3) ... [2023-11-29 01:58:23,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd8d6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:58:23, skipping insertion in model container [2023-11-29 01:58:23,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:22" (2/3) ... [2023-11-29 01:58:23,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd8d6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:58:23, skipping insertion in model container [2023-11-29 01:58:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:58:23" (3/3) ... [2023-11-29 01:58:23,558 INFO L112 eAbstractionObserver]: Analyzing ICFG strtok_r.i [2023-11-29 01:58:23,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:58:23,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-11-29 01:58:23,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:58:23,649 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@451683e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:58:23,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-29 01:58:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:58:23,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:23,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:58:23,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:23,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 194438, now seen corresponding path program 1 times [2023-11-29 01:58:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798220758] [2023-11-29 01:58:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798220758] [2023-11-29 01:58:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798220758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:23,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:23,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:58:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176011501] [2023-11-29 01:58:23,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:23,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:23,868 INFO L87 Difference]: Start difference. First operand has 66 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:23,971 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-11-29 01:58:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 01:58:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:23,983 INFO L225 Difference]: With dead ends: 67 [2023-11-29 01:58:23,984 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 01:58:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:23,990 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:23,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 01:58:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 01:58:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-11-29 01:58:24,031 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 3 [2023-11-29 01:58:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:24,032 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-11-29 01:58:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-11-29 01:58:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:58:24,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:24,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:58:24,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:58:24,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:24,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 194348, now seen corresponding path program 1 times [2023-11-29 01:58:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673024290] [2023-11-29 01:58:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673024290] [2023-11-29 01:58:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673024290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:24,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517337207] [2023-11-29 01:58:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:24,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:24,122 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:24,195 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-11-29 01:58:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 01:58:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:24,197 INFO L225 Difference]: With dead ends: 64 [2023-11-29 01:58:24,197 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 01:58:24,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:24,200 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:24,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 01:58:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-29 01:58:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 2.176470588235294) internal successors, (74), 63 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) [2023-11-29 01:58:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2023-11-29 01:58:24,209 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 3 [2023-11-29 01:58:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:24,209 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2023-11-29 01:58:24,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2023-11-29 01:58:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:58:24,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:24,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:58:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:58:24,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:24,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash 194349, now seen corresponding path program 1 times [2023-11-29 01:58:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:24,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062118136] [2023-11-29 01:58:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:24,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062118136] [2023-11-29 01:58:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062118136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833802076] [2023-11-29 01:58:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:24,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:24,403 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:24,500 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2023-11-29 01:58:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:58:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 01:58:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:24,502 INFO L225 Difference]: With dead ends: 65 [2023-11-29 01:58:24,502 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 01:58:24,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:24,504 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:24,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 94 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 01:58:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-29 01:58:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2023-11-29 01:58:24,512 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 3 [2023-11-29 01:58:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:24,512 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2023-11-29 01:58:24,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2023-11-29 01:58:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:58:24,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:24,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:58:24,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:58:24,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:24,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 186929510, now seen corresponding path program 1 times [2023-11-29 01:58:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747872763] [2023-11-29 01:58:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:24,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747872763] [2023-11-29 01:58:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747872763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:24,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353095257] [2023-11-29 01:58:24,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:24,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:24,617 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:24,707 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2023-11-29 01:58:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:58:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 01:58:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:24,708 INFO L225 Difference]: With dead ends: 64 [2023-11-29 01:58:24,708 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 01:58:24,709 INFO L412 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 [2023-11-29 01:58:24,710 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:24,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 01:58:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 01:58:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-11-29 01:58:24,717 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 5 [2023-11-29 01:58:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:24,717 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-11-29 01:58:24,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-11-29 01:58:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 01:58:24,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:24,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:58:24,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:58:24,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:24,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1499845055, now seen corresponding path program 1 times [2023-11-29 01:58:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140767924] [2023-11-29 01:58:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140767924] [2023-11-29 01:58:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140767924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:58:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987812465] [2023-11-29 01:58:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:24,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:24,801 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:24,859 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-11-29 01:58:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:58:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 01:58:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:24,870 INFO L225 Difference]: With dead ends: 60 [2023-11-29 01:58:24,870 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 01:58:24,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:24,872 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 124 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:24,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:58:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 01:58:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 01:58:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-29 01:58:24,878 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 6 [2023-11-29 01:58:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:24,878 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-29 01:58:24,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-29 01:58:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:58:24,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:24,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:24,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:58:24,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:24,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash -749437567, now seen corresponding path program 1 times [2023-11-29 01:58:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:24,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162931078] [2023-11-29 01:58:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162931078] [2023-11-29 01:58:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162931078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:25,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:58:25,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789031175] [2023-11-29 01:58:25,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:25,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:58:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:58:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:25,020 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:25,136 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-29 01:58:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 01:58:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:25,138 INFO L225 Difference]: With dead ends: 56 [2023-11-29 01:58:25,138 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 01:58:25,138 INFO L412 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 [2023-11-29 01:58:25,139 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 132 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:25,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 01:58:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-29 01:58:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-11-29 01:58:25,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 7 [2023-11-29 01:58:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:25,145 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-11-29 01:58:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-11-29 01:58:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:58:25,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:25,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:25,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:58:25,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:25,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -749437566, now seen corresponding path program 1 times [2023-11-29 01:58:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949792626] [2023-11-29 01:58:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949792626] [2023-11-29 01:58:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949792626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:25,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:25,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:58:25,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758628103] [2023-11-29 01:58:25,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:25,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:58:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:58:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:58:25,446 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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) [2023-11-29 01:58:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:25,736 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-29 01:58:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:58:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 [2023-11-29 01:58:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:25,737 INFO L225 Difference]: With dead ends: 72 [2023-11-29 01:58:25,737 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 01:58:25,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:58:25,738 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 218 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:25,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 46 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:58:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 01:58:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2023-11-29 01:58:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.95) internal successors, (78), 62 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) [2023-11-29 01:58:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-11-29 01:58:25,745 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 7 [2023-11-29 01:58:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:25,745 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-11-29 01:58:25,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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) [2023-11-29 01:58:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-11-29 01:58:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:58:25,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:25,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:25,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:58:25,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:25,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1345004101, now seen corresponding path program 1 times [2023-11-29 01:58:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710574834] [2023-11-29 01:58:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:25,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710574834] [2023-11-29 01:58:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710574834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:58:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111424458] [2023-11-29 01:58:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:25,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:58:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:58:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:25,875 INFO L87 Difference]: Start difference. First operand 63 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) [2023-11-29 01:58:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:25,991 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2023-11-29 01:58:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:25,991 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 [2023-11-29 01:58:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:25,992 INFO L225 Difference]: With dead ends: 61 [2023-11-29 01:58:25,992 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 01:58:25,992 INFO L412 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 [2023-11-29 01:58:25,993 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 87 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:25,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 69 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 01:58:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-29 01:58:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.825) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-29 01:58:25,999 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 9 [2023-11-29 01:58:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:25,999 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-29 01:58:25,999 INFO L496 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) [2023-11-29 01:58:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-29 01:58:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:58:26,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:26,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:26,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:58:26,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:26,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1345004102, now seen corresponding path program 1 times [2023-11-29 01:58:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077545601] [2023-11-29 01:58:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077545601] [2023-11-29 01:58:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077545601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:58:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389208623] [2023-11-29 01:58:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:26,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:58:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:26,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:58:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:58:26,241 INFO L87 Difference]: Start difference. First operand 60 states and 73 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) [2023-11-29 01:58:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:26,442 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2023-11-29 01:58:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:58:26,445 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 [2023-11-29 01:58:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:26,446 INFO L225 Difference]: With dead ends: 77 [2023-11-29 01:58:26,446 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 01:58:26,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:58:26,447 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 178 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:26,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 68 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 01:58:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2023-11-29 01:58:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 70 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2023-11-29 01:58:26,454 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 9 [2023-11-29 01:58:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:26,455 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2023-11-29 01:58:26,455 INFO L496 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) [2023-11-29 01:58:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2023-11-29 01:58:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:58:26,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:26,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:26,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:58:26,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:26,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1254543510, now seen corresponding path program 1 times [2023-11-29 01:58:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097902799] [2023-11-29 01:58:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097902799] [2023-11-29 01:58:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097902799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:58:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794265682] [2023-11-29 01:58:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:26,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:58:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:58:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:58:26,689 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:26,880 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2023-11-29 01:58:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:58:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-29 01:58:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:26,882 INFO L225 Difference]: With dead ends: 104 [2023-11-29 01:58:26,882 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 01:58:26,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:58:26,883 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:26,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 82 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 01:58:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2023-11-29 01:58:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 75 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2023-11-29 01:58:26,888 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 10 [2023-11-29 01:58:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:26,889 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2023-11-29 01:58:26,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2023-11-29 01:58:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:58:26,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:26,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:26,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:58:26,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:26,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1269500011, now seen corresponding path program 1 times [2023-11-29 01:58:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177571188] [2023-11-29 01:58:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177571188] [2023-11-29 01:58:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177571188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:26,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:26,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616857385] [2023-11-29 01:58:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:26,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:26,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:26,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:26,952 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:26,992 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2023-11-29 01:58:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:58:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:26,993 INFO L225 Difference]: With dead ends: 75 [2023-11-29 01:58:26,993 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 01:58:26,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:26,994 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:26,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:58:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 01:58:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 01:58:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2023-11-29 01:58:26,999 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 12 [2023-11-29 01:58:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:26,999 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2023-11-29 01:58:26,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2023-11-29 01:58:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:58:27,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:58:27,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1269500012, now seen corresponding path program 1 times [2023-11-29 01:58:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687825756] [2023-11-29 01:58:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687825756] [2023-11-29 01:58:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687825756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081959496] [2023-11-29 01:58:27,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:27,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:27,097 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:27,141 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2023-11-29 01:58:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:58:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:27,142 INFO L225 Difference]: With dead ends: 74 [2023-11-29 01:58:27,142 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 01:58:27,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:27,143 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:27,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:58:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 01:58:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 01:58:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2023-11-29 01:58:27,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 12 [2023-11-29 01:58:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:27,147 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2023-11-29 01:58:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2023-11-29 01:58:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:58:27,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:58:27,148 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1269498030, now seen corresponding path program 1 times [2023-11-29 01:58:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174854007] [2023-11-29 01:58:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174854007] [2023-11-29 01:58:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174854007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:27,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299421227] [2023-11-29 01:58:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:27,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:27,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:27,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:27,236 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-11-29 01:58:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:27,336 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2023-11-29 01:58:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:58:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 [2023-11-29 01:58:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:27,338 INFO L225 Difference]: With dead ends: 76 [2023-11-29 01:58:27,338 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 01:58:27,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:27,339 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 41 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:27,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 55 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 01:58:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-11-29 01:58:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 73 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2023-11-29 01:58:27,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 12 [2023-11-29 01:58:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:27,343 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2023-11-29 01:58:27,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-11-29 01:58:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2023-11-29 01:58:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:58:27,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:58:27,344 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1269498029, now seen corresponding path program 1 times [2023-11-29 01:58:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319631823] [2023-11-29 01:58:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319631823] [2023-11-29 01:58:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319631823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:27,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:27,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:58:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702029900] [2023-11-29 01:58:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:27,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:58:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:58:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:27,419 INFO L87 Difference]: Start difference. First operand 74 states and 95 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) [2023-11-29 01:58:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:27,509 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2023-11-29 01:58:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:58:27,509 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 [2023-11-29 01:58:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:27,510 INFO L225 Difference]: With dead ends: 72 [2023-11-29 01:58:27,510 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 01:58:27,510 INFO L412 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 [2023-11-29 01:58:27,511 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:27,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 01:58:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 01:58:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 71 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) [2023-11-29 01:58:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2023-11-29 01:58:27,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 12 [2023-11-29 01:58:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:27,514 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2023-11-29 01:58:27,515 INFO L496 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) [2023-11-29 01:58:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2023-11-29 01:58:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:58:27,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:58:27,516 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1271171761, now seen corresponding path program 1 times [2023-11-29 01:58:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643548820] [2023-11-29 01:58:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643548820] [2023-11-29 01:58:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643548820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054662833] [2023-11-29 01:58:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:27,544 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:27,571 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2023-11-29 01:58:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:27,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:58:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:27,572 INFO L225 Difference]: With dead ends: 76 [2023-11-29 01:58:27,572 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 01:58:27,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:27,573 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:27,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:58:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 01:58:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-29 01:58:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 75 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2023-11-29 01:58:27,577 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 12 [2023-11-29 01:58:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:27,577 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2023-11-29 01:58:27,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2023-11-29 01:58:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:58:27,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:58:27,579 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 699795272, now seen corresponding path program 1 times [2023-11-29 01:58:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184953290] [2023-11-29 01:58:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:27,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:27,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184953290] [2023-11-29 01:58:27,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184953290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:27,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:27,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903590512] [2023-11-29 01:58:27,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:27,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:58:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:58:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:27,835 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-29 01:58:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:27,916 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2023-11-29 01:58:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2023-11-29 01:58:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:27,918 INFO L225 Difference]: With dead ends: 75 [2023-11-29 01:58:27,918 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 01:58:27,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:27,919 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:27,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 90 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 01:58:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-29 01:58:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 72 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2023-11-29 01:58:27,922 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 13 [2023-11-29 01:58:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:27,922 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2023-11-29 01:58:27,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-29 01:58:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2023-11-29 01:58:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:58:27,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:27,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:27,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:58:27,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:27,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 216896081, now seen corresponding path program 1 times [2023-11-29 01:58:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682460985] [2023-11-29 01:58:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682460985] [2023-11-29 01:58:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682460985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710217206] [2023-11-29 01:58:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:28,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:28,023 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:28,075 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2023-11-29 01:58:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:58:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 01:58:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:28,077 INFO L225 Difference]: With dead ends: 71 [2023-11-29 01:58:28,077 INFO L226 Difference]: Without dead ends: 71 [2023-11-29 01:58:28,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:58:28,077 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:28,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:58:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-29 01:58:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-29 01:58:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 70 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2023-11-29 01:58:28,081 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 14 [2023-11-29 01:58:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:28,081 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2023-11-29 01:58:28,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2023-11-29 01:58:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:58:28,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:28,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:28,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:58:28,082 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:28,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash 216896082, now seen corresponding path program 1 times [2023-11-29 01:58:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095137465] [2023-11-29 01:58:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095137465] [2023-11-29 01:58:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095137465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:58:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006081510] [2023-11-29 01:58:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:58:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:58:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:58:28,298 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:58:28,443 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2023-11-29 01:58:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:58:28,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 01:58:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:58:28,444 INFO L225 Difference]: With dead ends: 82 [2023-11-29 01:58:28,444 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 01:58:28,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:58:28,445 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 136 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:58:28,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:58:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 01:58:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2023-11-29 01:58:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.492063492063492) internal successors, (94), 74 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-11-29 01:58:28,448 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 14 [2023-11-29 01:58:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:58:28,448 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-11-29 01:58:28,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-11-29 01:58:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:58:28,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:58:28,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:28,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:58:28,450 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 01:58:28,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1813444100, now seen corresponding path program 1 times [2023-11-29 01:58:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008085406] [2023-11-29 01:58:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:58:28,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:58:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:58:28,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:58:28,503 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:58:28,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2023-11-29 01:58:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-11-29 01:58:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-11-29 01:58:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-11-29 01:58:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-11-29 01:58:28,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-11-29 01:58:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-11-29 01:58:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-11-29 01:58:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-11-29 01:58:28,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-11-29 01:58:28,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-11-29 01:58:28,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-11-29 01:58:28,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-11-29 01:58:28,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-11-29 01:58:28,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-11-29 01:58:28,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-11-29 01:58:28,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-11-29 01:58:28,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-11-29 01:58:28,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-11-29 01:58:28,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-11-29 01:58:28,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2023-11-29 01:58:28,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:58:28,514 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:28,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:58:28,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc25 [2023-11-29 01:58:28,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-29 01:58:28,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated [2023-11-29 01:58:28,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-11-29 01:58:28,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-29 01:58:28,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-29 01:58:28,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated [2023-11-29 01:58:28,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:58:28 BoogieIcfgContainer [2023-11-29 01:58:28,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:58:28,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:58:28,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:58:28,557 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:58:28,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:58:23" (3/4) ... [2023-11-29 01:58:28,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 01:58:28,567 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc25 [2023-11-29 01:58:28,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated [2023-11-29 01:58:28,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-29 01:58:28,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated [2023-11-29 01:58:28,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-29 01:58:28,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-29 01:58:28,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-11-29 01:58:28,598 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:58:28,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:58:28,599 INFO L158 Benchmark]: Toolchain (without parser) took 6052.93ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 110.5MB in the beginning and 50.4MB in the end (delta: 60.1MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,600 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 122.1MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:58:28,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.15ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 93.1MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.44ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,601 INFO L158 Benchmark]: Boogie Preprocessor took 67.41ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,601 INFO L158 Benchmark]: RCFGBuilder took 500.51ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 63.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,602 INFO L158 Benchmark]: TraceAbstraction took 5005.07ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 62.3MB in the beginning and 53.5MB in the end (delta: 8.7MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,602 INFO L158 Benchmark]: Witness Printer took 41.41ms. Allocated memory is still 182.5MB. Free memory was 53.5MB in the beginning and 50.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:58:28,604 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.20ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 122.1MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.15ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 93.1MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.44ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.41ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.51ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 63.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5005.07ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 62.3MB in the beginning and 53.5MB in the end (delta: 8.7MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 41.41ms. Allocated memory is still 182.5MB. Free memory was 53.5MB in the beginning and 50.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc25 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc25 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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}, delim={4:0}, ptrptr={2:0}, ptrptr={2:0}, s={3: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}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L510] EXPR \read(*s) [L510] COND TRUE *s [L511] a = accept VAL [a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] EXPR \read(*a) [L511] *a && *s != *a VAL [a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3: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}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] a++ VAL [a={4:1}, accept={4:0}, accept={4:0}, l=0, s={3: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, 66 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1582 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1582 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 499 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1241 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 628 mSDtfsCounter, 1241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=10, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 01:58:28,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2bed020-9096-4ea6-988c-72453d1460b1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)